Low latency polar coding and decoding by merging of states of the polar code graph

ABSTRACT

A polar decoder kernal is described. The polar decoder kernal is configured to: receive one or more soft bits from a soft kernal encoded block having a block size of N and output one or more recovered kernal information bits from a recovered kernal information block having a block size of N. The polar decoder kernal comprises a decomposition of a polar code graph into an arbitrary number of columns depending on the kernal block size N.

FIELD OF THE INVENTION

The field of the invention relates to a polar decoder, a communication unit, an integrated circuit and a method for polar decoding. The invention is applicable to, but not limited to, polar decoding for current and future generations of communication standards.

BACKGROUND OF THE INVENTION

In accordance with the principles of Forward Error Correction (FEC) and channel coding, polar coding [1] may be used to protect information against the effects of transmission errors within an imperfect communication channel, which may suffer from noise and other detrimental effects. More specifically, a polar encoder is used in the transmitter to encode the information and a corresponding polar decoder is used in the receiver to mitigate transmission errors and recover the transmitted information. The polar encoder converts an information block comprising K bits into an encoded block comprising a greater number of bits M>K, according to a prescribed encoding process. In this way, the encoded block conveys the K bits of information from the information block, together with M−K bits of redundancy. This redundancy may be exploited in the polar decoder according to a prescribed decoding process, in order to estimate the values of the original K bits from the information block. Provided that the condition of the communication channel is not too severe, the polar decoder can correctly estimate the values of the K bits from the information block with a high probability.

The polar encoding process comprises three steps. In a first information block conditioning step, redundant bits are inserted into the information block in prescribed positions, in order to increase its size from K bits to N bits, where N is a power of two. In a second polar encoding kernal step, the N bits of the resultant kernal information block are combined in different combinations using successive eXclusive OR (XOR) operations, according to a prescribed graph structure. This graph structure comprises n=log₂(N) successive stages, each comprising N/2 XOR operations, which combine particular pairs of bits. In a third step, encoded block conditioning is applied to the resultant kernal encoded block, in order to adjust its size from N bits to M bits. This may be achieved by repeating or removing particular bits in the kernal encoded block according to a prescribed method, in order to produce the encoded block, which is transmitted over a channel or stored in a storage media.

A soft encoded block is received from the channel or retrieved from the storage media. The polar decoding process comprises three steps, which correspond to the three steps in the polar encoding process, but in a reverse order. In a first encoded block conditioning step, redundant soft bits are inserted or combined into the soft encoded block in prescribed positions, in order to adjust its size from M soft bits to N soft bits, where N is a power of two. In a second polar decoding kernal step, the N soft bits of the resultant kernal encoded block are combined in different combinations using a Successive Cancellation (SC) [1] or Successive Cancellation List (SCL) [7] process, which operates on the basis of the prescribed graph structure. In a third step, information block conditioning is applied to the resultant recovered kernal information block, in order to reduce its size from N bits to K bits. This may be achieved by removing particular bits in the recovered kernal information block according to a prescribed method, in order to produce the recovered information block.

Several hardware implementations of SC [1] and SCL [7] polar decoders have been previously proposed [8], [14]-[24], which are capable of flexibly supporting different kernal block sizes N∈{2, 4, 8, . . . , N_(max)} at run-time. These decoders conceptually represent the polar code using a graph [15] (or equivalently a tree [18]), which has dimensions that vary depending on the kernal block size N. As exemplified in FIG. 7, the graph comprises N inputs on its right-hand edge which accept soft bits (often in the form of Log-Likelihood Ratios (LLRs) [8]) from the demodulator, as well as N outputs on its left-hand edge which supply hard bit decisions for the information and frozen bits. Between these two edges, the graph comprises log 2(N) horizontally-concatenated stages, each of which comprises N/2 vertically-aligned XOR operations.

The hardware implementations of [8], [14]-[24] employ dedicated hardware to combine soft bits at the location of each XOR in the graph using f and g functions [8], as well as to conceptually propagate them from right to left in the graph. Likewise, dedicated hardware is conceptually employed at the left-hand edge of the graph, to convert the soft bits into hard bit decisions, as well as to compute and sort SCL path metrics [8]. Finally, dedicated hardware is used to combine hard bit decisions according to the XORs in the graph and to conceptually propagate the resultant partial sum bits from left to right in the graph, so that they can be used by the g function. Note that the reliance of the g function upon the partial sum bits imposes a set of data dependencies, which require all of the above-mentioned operations to be performed according to a particular schedule. This leaves only a limited degree of freedom to perform operations in parallel, which varies as the decoding process progresses. The line decoder of [14] achieves a high degree of parallel processing during soft bit propagation, which allows all f and g functions to be computed within a latency of 2N−2 clock cycles. This is achieved using L lines of N_(max)/2 processing units, where L=1 for SC decoding and L>1 is the list size for SCL decoding. Each processing unit is capable of computing one f function or one g function in each clock cycle. This degree of parallelism is sufficient to simultaneously perform the maximum number of computations within any single stage of the graph that are not prevented by data dependencies. This peak opportunity for parallel processing is encountered when N=N_(max) and when computing g functions for the right-most stage in the graph. However, the above-mentioned data dependencies prevent the parallelism from being fully exploited when N<N_(max) or when computing f or g functions at other times during the decoding process. Owing to this, the line decoder of [14] suffers from a poor hardware efficiency and also a requirement for an excessively high memory bandwidth, which can grant simultaneous access to up to N_(max) soft bits. Motivated by this, the semi-parallel decoders of [8], [15]-[24] improve the hardware efficiency and memory bandwidth requirement by reducing the degree of parallel processing from LN_(max)/2 to LP, where P∈{1, 2, 4, 8, . . . }. However, this approach still suffers from being unable to exploit all parallelism for the left-most stages and requires several clock cycles to perform the f and g for the right-most stages, increasing the total latency associated with f and g computation to Σ_(i=1) ^(log) ² ^((N))2^(i) max(N/(2^(i)P), 1) clock cycles. Besides the above-mentioned clock cycles required for f and g computations, SCL decoders typically require at least one additional clock cycle to compute and sort the path metrics associated with each of the N hard bit decisions made on the left-hand edge of the graph. In the case of line decoding, a latency of 3N−2 clock cycles is required to perform f, g and path metric computations, as well as to sort the latter. However, in [32], [33], the path metrics are computed and sorted for several bits at a time, together with the corresponding f and g functions in the left-most stages of the graph. When 2^(k) hard bit decisions are made at a time, this approach reduces the total number of clock cycles required for line decoding to N/2^(k-2)−2 [33], where k∈{1, 2, 3, . . . }. Note that the latency of SCL decoding can be further reduced when the polar code adopts a low coding rate. In this case, any computations relating to frozen bits at the start of the block can be skipped, although this technique does not improve the worst-case latency, which is encountered for high coding rates.

Note that the propagation of partial sum bits is typically performed concurrently with the computations described above, within the same clock cycles. In [8], [15], [30], partial-sum update logic is used to accumulate different combinations of the decoded bits and an interconnection network is used to deliver them to the processing of the corresponding g functions. This results in a large hardware overhead and a long critical path, which limits the achievable hardware efficiency, throughput and latency. By contrast, the feed-forward architecture of [19], [21], [28], [32], [34] uses dedicated hardware to propagate partial sum bits to each successive stage of the graph. However, the complexity of the feed-forward architecture grows rapidly for each successive stage, limiting the maximum kernal block length N_(max) that can be supported and limiting the hardware efficiency. By contrast, the approach of [17], [22], [27], [35] uses a simplified polar encoder kernal to calculate the partial sum bits, although this does not benefit from reusing calculations that are performed as a natural part of the decoding process. In the above-described previous polar decoder hardware implementations, the hardware resource usage is typically dominated by memory. For example, 90% of the hardware is occupied by memory in the L=8 SCL decoder of [8], owing to the requirement to store LLRs at the interface between each pair of consecutive stages in the graph. The next biggest contributor to hardware resource is used to process and propagate the LLRs and partial sum bits, occupying around 5% of the hardware in the L=8 SCL decoder of [8]. Of this processing and propagation hardware, around 80% is dedicated to the interconnection network associated with the partial sum bits [15]. Finally, around 1% of the hardware is dedicated to path metric computation and sorting in the L=8 SCL decoder of [8], as well as in the L=4 SCL decoders of [18], [19]. However, these operations can be expected to occupy significantly more hardware in the multi-bit approaches of [32], [33].

SUMMARY OF THE INVENTION

The present invention provides a polar decoder, a communication unit, an integrated circuit and a method for polar decoding, as described in the accompanying claims.

Specific embodiments of the invention are set forth in the dependent claims.

These and other aspects of the invention will be apparent from and elucidated with reference to the embodiments described hereinafter.

BRIEF DESCRIPTION OF THE DRAWINGS

Further details, aspects and embodiments of the invention will be described, by way of example only, with reference to the drawings. In the drawings, like reference numbers are used to identify like or functionally similar elements. Elements in the FIG's are illustrated for simplicity and clarity and have not necessarily been drawn to scale.

FIG. 1 illustrates an example top-level schematic of a communication unit having a polar encoder and polar decoder, adapted according to example embodiments of the invention.

FIG. 2 illustrates an example graphical representation of the generator matrices F, F^(⊕2) and F^(⊕3), according to example embodiments of the invention.

FIG. 3 illustrates an example polar encoding process, using the graphical representation of the generator matrix F^(⊕3), illustrating the case where a particular frozen bit pattern is used to convert the K=4 information bits a=[1001] into the M=8 encoded bits b=[00001111], according to example embodiments of the invention.

FIG. 4 illustrates an example of the three computations that can be performed for a basic computation unit of the proposed polar decoder kernal: (a) the f function, (b) the g function and (c) partial sum calculation, according to example embodiments of the invention.

FIG. 5 illustrates an example of an SC decoding process, using the graphical representation of a generator matrix F^(⊕3), for a case where a particular frozen bit pattern is used to convert a particular vector ˜b of M=8 encoded LLRs into the K=4 recovered information bits {circumflex over ( )}a=[1001], according to example embodiments of the invention.

FIG. 6 illustrates an example schematic of the proposed polar decoder kernal for the case where C_(max)=5, according to example embodiments of the invention.

FIG. 7 illustrates an example graphical representation of the generator matrix F^(⊕6), which has been grouped into C=4 columns comprising s=[1; 2; 2; 1] stages, and which correspond to s_(o)=1 and s_(i)=2, according to example embodiments of the invention.

FIG. 8 illustrates an example flowchart of a decoding process employed by the proposed polar decoder kernal, whereby each cycle around the main loop of the flowchart corresponds to one step of the decoding process, according to example embodiments of the invention.

FIG. 9 illustrates an example timing diagram for the proposed polar decoder kernal, according to example embodiments of the invention.

FIG. 10 illustrates an example plot of a number of steps required by the decoding process of the proposed polar decoder kernal, according to example embodiments of the invention.

FIG. 11 illustrates an example rearranged graphical representation of the generator matrix F^(⊕6), for the case of employing C=4 columns comprising s=[1; 2; 2; 1] stages, according to example embodiments of the invention.

FIG. 12 illustrates an example schematic of a proposed processing unit that can be reconfigured to perform either the ‘f’ function of (2) or the ‘g’ function of (3), according to example embodiments of the invention.

FIG. 13 illustrates an example of the known art on the two's complement implementation of the ‘f’ function of (2): (a) Naive implementation; (b) A reduced hardware implementation; (c) A reduced critical path implementation.

FIG. 14 illustrates an example schematic of the inner datapath in the proposed polar decoder kernal, for the example of s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 15 illustrates an example schematic of an outer datapath for SC decoding in the proposed polar decoder kernal, for the example of s_(o)=2 and n_(i)=4, according to example embodiments of the invention.

FIG. 16 illustrates an example schematic of a partial sum datapath in the proposed polar decoder kernal, for the example of s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 17 illustrates an example schematic of the interaction between the inner datapath, LLR memory blocks and controller of the proposed polar decoder kernal, according to example embodiments of the invention.

FIG. 18 illustrates an example schematic of the interaction between the inner datapath, bit memory blocks and controller of the proposed polar decoder kernal, for the case where s_(i)=1 and n_(i)=4, according to example embodiments of the invention.

FIG. 19 illustrates an example of the contents of the LLR following a completion of the decoding process, for the case where N=128, N_(max)=128, s_(o)=1, s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 20 illustrates an example of the contents of the LLR and bit memories following a completion of the decoding process, for the case where N=64, N_(max)=128, s_(o)=1, s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 21 illustrates an example of the contents of the LLR and bit memories following a completion of the decoding process, for the case where N=32, N_(max)=128, s_(o)=1, s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 22 illustrates an example of the contents of the LLR and bit memories following the completion of the decoding process, for the case where N=16, N_(max)=128, s_(o)=1, s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 23 illustrates an example of the contents of the LLR and bit memories following a completion of the decoding process, for the case where N=8, N_(max)=128, s_(o)=1, s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 24 illustrates a typical computing system that may be employed in an electronic device or a wireless communication unit to perform polar encoding operations in accordance with some example embodiments of the invention.

DETAILED DESCRIPTION

Motivated by the discussions above, the present invention is a novel polar decoder architecture, which enables flexible, low latency, hardware-efficient SCL polar decoding. Rather than processing one stage of the polar code graph at a time, the proposed architecture achieves a higher degree of parallelism by processing several consecutive stages at once. It is demonstrated that this parallel processing can be fully exploited throughout the majority of the f and g computations, achieving greater hardware utility than line and semi-parallel architectures. Furthermore, since several consecutive stages are processed at once, memory is only required at the interfaces between each pair of consecutive groupings of stages, rather than at the interfaces between each pair of consecutive individual stages. This significantly reduces the overall memory requirement of the proposed architecture relative to previous implementations, which is particularly impactful since memory is the biggest contributor to hardware resource usage. Finally, a simple mechanism for propagating partial sum bits is proposed, which is also impactful since partial sum propagation is the second biggest contributor to hardware resource usage in previous implementations.

In a first aspect, examples of the present invention describe a polar decoder kernal configured to receive one or more soft bits from a soft kernal encoded block having a block size of N; and output one or more recovered kernal information bits from a recovered kernal information block having a block size of N. The polar decoder kernal comprises a decomposition of a polar code graph into an arbitrary number of columns depending on the kernal block size N.

In this manner, memory is not required to store bits and soft bits at the interface between each consecutive pair of stages in the polar code graph, as in the prior art. Instead, only a smaller amount of memory is required to store bits and soft bits at the interface between each consecutive pair of the smaller number of columns in the polar code graph. Furthermore, the number of steps required to complete the polar decoding process is not dictated by the number of stages in the polar code graph, as in the prior art. Instead, the number of steps required can be reduced, since each step can complete operations across the width of one column.

In some examples, the polar code graph may be decomposed into the arbitrary number (C) of columns and that multiple (n=log 2(N)) stages in the polar code graph may be distributed among these columns. In this manner, the polar decoder kernal can be flexibly adapted to support different parameterisations at both design time and at run time. At design time, this feature allows the control of the trade-offs between hardware resource requirement and the number of steps required to complete the polar decoding process, for example. At run time, this feature allows the support of different kernal block sizes, for example.

In some examples, the polar decoder kernal may be configured to group a plurality of the multiple (n=log 2(N)) stages stages in the polar code graph into the arbitrary number of columns where the arbitrary number may be in a range of ‘1’ to ‘C_(max)’. In this manner, the hardware resource requirement of the polar decoder kernal is directly bounded by the deliberate selection of C_(max), rather than as an indirect result of other parameter selections.

In some examples, a controller may be configured to form the arbitrary number of columns and wherein each column may include an arbitrary number of stages in the polar code graph. In this manner, the polar decoder kernal may be flexibly adapted at run time to support different kernal block sizes, for example.

In some examples, a maximum number of columns (C_(max)) may be selected based on a maximum block size (N_(max)), a maximum number of stages accommodated in an outer column (s_(o)) and a maximum number of stages accommodated in each inner column (s_(i)). In this manner, the hardware resource requirement of the polar decoder kernal is directly bounded by the deliberate selection of s_(o) and s_(i), rather than as an indirect result of other parameter selections. Furthermore, by adapting the number of stages in each column, the operation of the polar decoder kernal may be flexibly adapted at run time to support different block sizes using different number of steps in the decoding process, even if the number of stages in the polar code rather is not a multiple of the number of columns selected.

In some examples, a number of columns (C) may be selected depending on the current block size (N), a maximum number of stages accommodated in an outer column (s_(o)) and a maximum number of stages accommodated in each inner column (s_(i)). In this manner, the hardware resource requirement of the polar decoder kernal is directly bounded by the deliberate selection of s_(o) and s_(i), rather than as an indirect result of other parameter selections. Furthermore, by adapting the number of columns (C), the operation of the polar decoder kernal may be flexibly adapted at run time to support different block sizes using different number of steps in the decoding process.

In some examples a number of stages in each column may be selected in a polar decoding process depending on a current block size (N), a maximum number of stages accommodated in an outer column (s_(o)) and a maximum number of stages accommodated in each inner column (s_(i)). In this manner, the hardware resource requirement of the polar decoder kernal can be directly bounded at design time by the deliberate selection of C_(max), s_(o) and s_(i) rather than as an indirect result of other parameter selections.

In some examples the outer column may include s₀=s_(o) stages, and the remaining n-s₀ stages may be distributed among the C−1 inner columns, where s_(o) is the maximum number of stages in the outer column. In this manner, the outer column will comprise its maximum number of stages whenever possible, allowing the hardware resources in the outer datapath to be fully exploited whenever possible and maintaining a high hardware efficiency.

In some examples, the polar code graph may be decomposed into C=┌(n−s_(o))/s_(i)┐+1 number of columns, and a right-most inner column having the index C−1 may include s_(C−1)=n−s_(o)−(C−2)s_(i) stages and all other inner columns may include s_(c)=s_(i) stages, where s_(c) is a number of stages in the column having the index c. In this manner, a maximum number of inner columns will comprise their maximum number of stages whenever possible, allowing the hardware resources in the inner datapath to be fully exploited whenever possible and maintaining a high hardware efficiency.

In some examples, each column may include a number of rows, which may be expressed using the vector R=[R_(c)]_(c=0) ^(C−1), where the number of rows in a particular column (R_(c)) is given by R_(c)=N/r_(c) where r_(c) is a sub-code radix of the column. In some examples, each row may include a sub-graph comprising s_(c) stages and r_(c) consecutive connections on its left and right edges that are horizontally-aligned. In this manner, the data dependencies within the polar decoding process can be structured and considered as the basis as the control of the polar decoder kernal. More specifically, the data dependencies in the polar decoding process are such that each visit to each column will consider one of the rows in the column, where different rows in each column will be visited at different times during the polar decoding process.

In some examples, each row in the inner columns may be decomposed into one or more individual sub-rows that have no connections between each other. In this manner, the processing of the sub-rows may be performed independently, spread over consecutive steps of the polar decoding process, allowing the trade-off between the hardware resource requirement and the number of steps required to complete the process to be adjusted.

In some examples, computations associated with each visit to each row in each inner column may be spread over a number of consecutive steps of a decoding process, each of which performs computations for a different individual sub-row in the row in the inner column. In this manner, the same inner datapath can be reused to perform processing for different rows in different columns having different block sizes. More specifically, the processing of rows having higher block sizes can be spread over a greater number of steps, ensuring a high hardware efficiency.

In some examples, a block size of the decomposed individual sub-rows in each inner column may be selected as n_(c)=min(r_(c), n_(i)), where n_(i) specifies a maximum inner sub-row block size that adopts a value of any power of two in the range 2^(s) ^(i) to N_(max). In this manner, a maximum number of sub-rows will adopt the same block size as the inner datapath whenever possible, allowing the hardware resources in the inner datapath to be fully exploited whenever possible and maintaining a high hardware efficiency.

In some examples, each row in the outer column is visited once by a decoding process, whilst each row in an inner column is visited 2^(s) ^(o) times by the decoding process, where s_(c) is the number of stages in that inner column. In this manner, the data dependencies of the polar decoding process may be satisfied using a minimum number of visits to each column, therefore minimising the number of steps required to complete the decoding process.

In some examples, the polar decoder kernal may include a controller, a plurality of soft bit memory blocks and an inner datapath, an outer datapath, one or more partial sum datapath(s) and one or more bit memory block(s).

In some examples, the controller may configure a maximum number of stages in an outer column (s_(o)) to adopt any value in a range ‘0’ to n_(max)=log₂(N_(max)) and configure the maximum number of stages in each inner column (s_(i)) to adopt any value in the range 1 to n_(max)−s_(o). In this manner, the selection of the parameters s_(o) and s_(i) is sympathetic to the longest kernal block lengths that will be processed at run-time, bounding the hardware resource requirement to a level that can be fully exploited at run time.

In some examples, the polar decoder kernal may include a single instance of the outer datapath and a single instance of the inner datapath. In this manner, the different processing needs of the outer column and the inner columns may be met by separate datapaths that are tailored to their particular application.

In some examples, the polar decoder kernal comprises C_(max)−2 instances of the one or more partial sum datapaths, C_(max)−1 instances of the one or more bit memory blocks and C_(max) instances of the soft bit memory block. In this manner, a bit or soft bit memory block can be positioned at each interface between pairs of consecutive columns that exchange bits or soft bits. Furthermore, a partial sum datapath can be positioned in each column that propagates partial sum bits.

In some examples, the outer datapath, bit memory blocks and the partial sum datapaths form a chain that represents the arbitrary number of (C) columns in the polar code graph, such that the inner datapath is configured by the controller to take inputs from and provide outputs to different points in the chain, as a polar decoding process visits different inner columns in the polar code graph. In this manner, the inner datapath may be reused to perform processing for all inner columns, eliminating the requirement for using a different inner datapath to perform the processing for each different inner column.

In some examples, outer datapath may reside within an outer column. In this manner, the operation of the outer datapath can be tailored to the specific processing needs of the outer column.

In some examples, the inner datapath may reside within different inner columns having different indices c∈[1, C−1] during different steps of a polar decoding process. In this manner, the operation of the inner datapath can be tailored to the specific processing needs of the inner columns. Furthermore, the single inner datapath can be reused to process different inner columns at different times, eliminating the requirement for using multiple inner datapaths and reducing the hardware resource requirement of the polar decoder kernal.

In some examples, the partial sum datapath with an index c∈[1, C−2] may reside within an inner column of the polar code graph having a corresponding index c. In this manner, the operation of the partial sum datapath can be tailored to the specific processing needs of the partial sum propagation through each inner column.

In some examples, an input of each of the inner datapath, the outer datapath and the partial sum datapaths may be read from one of the plurality of soft bit memory blocks and/or one of the one or more bit memory blocks that reside at an interface on one or other edge on either side of a current column. In some examples, selected outputs of the inner datapath, the outer datapath and the partial sum datapaths may be written to one of the plurality of soft bit memory blocks and/or one of the one or more bit memory blocks that reside at the interface on either side of the current column. In this manner, the bit and soft bit memory blocks provide a mechanism for passing bits and soft bits between consecutive columns, in order to satisfy the data dependencies that are associated with the processing performed by the datapaths.

In some examples, an inner datapath residing in an inner column having the index c∈[1, C−2] may be configured to: accept input bits from the column to its left via the bit memory block having an index c, accept input soft bits from the column to its right via the soft bit memory block having an index c+1, and provide output soft bits to the column to its left via the soft bit memory block having an index c. In this manner, the inner datapath is able to accept inputs from adjacent columns that satisfy all of the data dependencies of its operation, as well as to provide outputs that contribute to satisfying the data dependencies of operations performed in adjacent columns.

In some examples, an inner datapath residing in an inner column having the index c=C−1 may be configured to: accept input bits from the column to its left via the bit memory block having an index c, accept input soft bits from a soft bit input of the polar decoder kernal via the soft bit memory block having an index C_(max), and provide output soft bits to the column to its left via the soft bit memory block having an index c. In this manner, the inner datapath is able to accept inputs from adjacent columns and from the soft bit input of the polar decoder kernal that satisfy all of the data dependencies of its operation, as well as to provide outputs that contribute to satisfying the data dependencies of operations performed in adjacent columns.

In some examples, inner datapath may be additionally configured to provide output soft bits to the column to its left via the soft bit memory block having an index c. In this manner, the bits calculated within the inner datapath can be output and later reused by the partial sum datapath, avoiding the requirement for the partial sum datapath to include additional hardware for recalculating these bits.

In some examples, a partial sum datapath residing in an inner column having the index c∈[1, C−2] may be configured to: accept input bits from the column to its left via the bit memory block having an index c, and provide output bits to the column to its right via the bit memory block having an index c+1. In this manner, the partial sum datapath is able to accept inputs from adjacent columns that satisfy all of the data dependencies of its operation, as well as to provide outputs that contribute to satisfying the data dependencies of operations performed in adjacent columns.

In some examples, an outer datapath residing in the outer column having the index c=0 may be configured to: accept input soft bits from the column to its right via the soft bit memory block having an index 1, provide output bits to the column to its right via the bit memory block having an index 1, and provide output bits to the bit output of the polar decoder kernal. In some examples, the output bits may be provided to the bit output of the polar decoder kernal via a bit memory block. In this manner, the outer datapath is able to accept inputs from adjacent columns that satisfy all of the data dependencies of its operation, as well as to provide outputs that contribute to satisfying the data dependencies of operations performed in adjacent columns and directly contribute to the bit output of the polar decoder kernal in the case of SC decoding.

In some examples, either the inner datapath or the outer datapath may be directed to process one sub-row of one row of one column in each step of a polar decoding process. In this manner, progress on the polar decoding process is made in every step and a high hardware utility and therefore hardware efficiency is maintained.

In some examples, the partial sum datapaths having indices ‘1’ to ‘c−1’ may each be directed to process one sub-row of one row in their corresponding column whenever the inner datapath is directed to process a second or subsequent visit to one sub-row of one row in the inner column having the index ‘c’. In this manner, the partial sum bits that satisfy a data dependency of the second or later visits by the inner datapath can be satisfied within the same step of the polar decoding process. More specifically, the partial sum datapaths can propagate partial sum bits generated by the outer datapath in the outer column to the inner datapath operating in an inner column without imposing a delay upon the polar decoding process.

In some examples, the inner datapath may include a polar code graph of XOR logic gates, where each input to a left-hand edge of the polar code graph is taken from a corresponding bit input on a left-hand edge of the inner datapath, whilst a corresponding output from a right-hand edge of the polar code graph is provided to a corresponding bit output that is also on the left-hand edge of the inner datapath. In some examples, the polar code graph may represent the right-most s_(i) number of stages in a graph representation of a generator matrix F^(⊗ log) ² ^((n) ^(i) ⁾. In this manner, the inner datapath can calculate all partial sum bits required to satisfy its data dependencies as functions of the partial sum bits generated by the partial sum datapaths.

In some examples, a lowest n_(i)/2^(s) ^(i) XOR logic gates in each stage may be omitted in the polar code graph of the inner datapath. In this manner, only XOR gates that operate on valid bits are retained, reducing the hardware resource requirement of the inner data path.

In some examples, the inner datapath may include a plurality of processing units arranged into s_(i) number of stages configured to perform at least one of: an ‘f’ function, a ‘g’ function, dependent on which visit is being made to a current sub-row. In this manner, the processing unit hardware can be repurposed to perform both the f and g functions at different times, eliminating the requirement for separate hardware for performing f and g functions and improving the hardware efficiency.

In some examples, a right-most stage in the plurality of processing units may include a plurality (n_(i)/2) of processing units and each successive stage to the left of the right-most stage contains half as many processing units as the stage to its right. In this manner, the inner datapath can employ the minimum number of processing units that is required to satisfy the data dependencies of the polar decoding process.

In some examples, the ‘f’ function may be: f≈sign({tilde over (x)}_(a))sign({tilde over (x)}_(b))min(|{tilde over (x)}_(a)|, |{tilde over (x)}_(b)|), where sign(⋅) returns ‘−1’ if its argument is negative and ‘+1’ if its argument if positive. In this manner, the computation requirements of the f function can be minimised.

In some examples, the ‘g’ function may be:

$\begin{matrix} {{\overset{\sim}{x}}_{d} = {g\left( {{\overset{\sim}{x}}_{a},{\overset{\sim}{x}}_{b},{\hat{u}}_{a}} \right)}} \\ {= {{\left( {- 1} \right)^{{\hat{u}}_{a}}{\overset{\sim}{x}}_{a}} + {{\overset{\sim}{x}}_{b}.}}} \end{matrix}\quad$

In some examples, each input to a right-hand edge of the plurality of processing units may be taken from a corresponding soft bit input on a right-hand edge of the inner datapath, whilst a corresponding output from a left-hand edge of the plurality of processing units may be provided to a corresponding soft bit output that is on the left-hand edge of the inner datapath.

In some examples, a visit index (v) in a range 0 to 2^(sc)−1 may be expressed in base-2 as a binary number having s_(c) bits, with each successive bit from right to left being used to control an operation of each successive stage of the plurality of processing units in the inner datapath from left to right, such that the least significant bit (LSB) of the binary number is used to control a left-most stage of the processing units and the most significant bit (MSB) of the binary number is used to control the right-most stage of the processing units. In some examples, the processing units may be configured to: perform the ‘f’ function in response to a bit value ‘0’ being used to control a stage of the processing units; and perform the ‘g’ function in response to a bit value ‘1’ being used to control the stage of processing units. In this manner, the processing units of the inner datapath may be controlled as a simple function of the visit index, with only a small hardware overhead.

In some examples, the polar decoder kernal is configured to operate on a Successive Cancellation (SC) basis wherein a recovered kernel information block is output from the polar decoder kernal concurrently with a processing of an outer column in the polar code graph, with a number of n_(b)=2^(s) ^(o) bits output at a time. In this manner, the process of outputting the recovered kernal information bits can be performed in-line with the process of generating them, without imposing any additional latency.

In some examples, the polar decoder kernal may include a plurality (L) of parallel replicas of the inner datapath, the one or more partial sum datapaths, the one or more bit memory blocks and the soft bit memory blocks, which are used in parallel to support Successive Cancellation List (SCL) decoding processes. In this manner, the generation of the L candidate kernal information blocks can be performed in parallel, rather than in series. This allows the size ‘L’ of the SCL list to be selected without affecting the latency of the polar decoder kernal.

In some examples, the processing units in the plurality of processing units may operate on the basis of a fixed point number representation where an incremental bit width is used in each successive stage from right to left. In some examples, a clipping circuit is used to reduce the bit width of soft bits output on the left-hand edge of the plurality of processing units, to match bit widths of soft bits input on the right-hand edge. In this manner, there is no requirement to clip the fixed point numbers after each stage in the plurality of processing units, preserving more soft bit information and maintaining superior error correction. By clipping the fixed point numbers at the left hand edge of the plurality of the processing units, a consistent fixed point bit width can be used for all soft bit memory blocks, as well as for the input and output soft bits of the inner datapath.

In some examples, a plurality of multiplexers may be configured to deliver a correct bit from the polar code graph that is selected depending on a visit index (v) to each processing unit of the plurality of processing units that computes a ‘g’ function. In this manner, the partial sum bits may be distributed from the polar code graph of XOR gates to the plurality of processing units using only a small hardware overhead.

In some examples, when a number of first stages (s_(c)) in a current column is lower than a maximum number of stages (s_(i)) in an inner column, a number of second stages in the polar code graph may be reduced to match the number of first stages (s_(c)) by disabling the XOR logic gates in the left-most stages of the polar code graph. In this manner, the inner datapath can be reused to perform processing for all inner columns, even if they contain fewer stages s_(c) than s_(i).

In some examples, AND logic gates may be used to mask corresponding vertical connections in the inner datapath. In this manner, the number of stages processed by the polar code graph of XOR gates can be reduced without the requirement for inserting hardware within the critical path.

In some examples, when a number of first stages (s_(c)) in a current column is lower than the maximum number of stages (s_(i)) in an inner column, a number of second stages in a plurality of processing units may be reduced to match the number of first stages (s_(c)) by using multiplexers to bypass one or more processing units in the left-most stages of the plurality of processing units. In this manner, the inner datapath can be reused to perform processing for all inner columns, even if they contain fewer stages s_(c) than s_(i).

In some examples, a soft bit memory block with an index c may include a single Random Access Memory (RAM), having a width of n_(i) fixed-point soft bits and a depth of max(r_(c−1,max)/n_(i),1) addresses, where the width and depth represent two dimensions of the soft bit memory block. In this manner, the seamless reading and writing of soft bits can be achieved when processing successive columns in the polar code graph. This avoids the requirement for complex interconnection networks between the soft bit memory blocks and the datapaths.

In some examples, a plurality of multiplexers may be provided at an input to respective write ports of a bit memory block having an index c′, wherein the plurality of multiplexers may be individually controlled by the controller to select between outputs provided by a partial sum datapath having an index (c′−1) and the inner datapath.

In some examples, a plurality of multiplexers may be provided at an input to a partial sum datapath having an index c′, wherein the plurality of multiplexers may be individually controlled by the controller to select between outputs provided by a bit memory block of the one or more bit memory blocks having an index c′ and a partial sum datapath having an index (c′−1). In this manner, the propagation of partial sum bits can bypass the bit memory blocks, allowing them to be delivered from the outer column to the inner column where they are needed within the same step of the decoding process where that inner column is processed. This eliminates the requirement for additional steps to propagate partial sum bits.

In some examples, the bit memory block with an index c may include 2^(s) ^(i) Random Access Memories (RAMs), having widths of n_(i) bits and depths of max(2^(s) ^(o) ^(+(c−1)s) ^(i) /n_(i), 1) addresses, where the RAMs, width and depth represent three dimensions of the bit memory block. In some examples, the bit memory block with an index c may include n_(i) RAMs, having widths of 2^(s) ^(i) bits and depths of max(2^(s) ^(o) ^(+(c−1)s) ^(i) /n_(i), 1) addresses. In this manner, the seamless reading and writing of bits can be achieved when processing successive columns in the polar code graph. This avoids the requirement for complex interconnection networks between the bit memory blocks and the datapaths.

In some examples, the recovered kernal information block may include a block size of N that is a vector comprising ‘N’ recovered kernal information bits û=[û_(j)]_(j=0) ^(N-1), where û_(j)∈{0, 1}. In some examples, the soft kernal encoded block may include a block size of N that is a vector comprising ‘N’ kernal encoded soft bits {circumflex over (x)}=[{circumflex over (x)}_(j)]_(j=0) ^(N-1).

In some examples, the partial sum datapath may accept n_(i) input bits on its left hand edge and may provide n_(i) output bits on its right hand edge, where each of the output bits having an index 0 to (n_(i)−n_(i)/2^(s) ^(i) −1) may be set equal to an XOR of the input bit with a corresponding index and one of the input bits having an index (n_(i)−n_(i)/2^(s) ^(i) ) to (n_(i)−1), and where each of the output bits having an index (n_(i)−n_(i)/2^(s) ^(i) ) to (n_(i)−1) may be set equal to the input bit with the corresponding index. In some examples, the input bit having an index ‘0’ to (n_(i)−n_(i)/2^(s) ^(i) −1) may be XORed with the input bit having an index (n_(i)−n_(i)/2^(s) ^(i) ) to (n_(i)−1), such that both indices have the same value modulo n_(i)/2^(s) ^(i) . In this manner, the partial sum datapath may calculate only the partial sum bits that were not already calculated by the inner datapath, eliminating the unnecessary recalculation of partial sum bits and minimising the hardware requirement and critical path length of the partial sum datapath.

In a second aspect, examples of the present invention describe a communication unit comprising a polar decoder kernel according to the first aspect.

In a third aspect, examples of the present invention describe an integrated circuit comprising a polar decoder kernel according to the first aspect.

In a fourth aspect, examples of the present invention, a method of polar decoding is described according to the first aspect. The method includes: decomposing a polar code graph into an arbitrary number of columns depending on the kernal block size N; receiving one or more soft bits from a soft kernal encoded block having a block size of N; processing encoded bits; and outputting one or more recovered kernal information bits from a recovered kernal information block having a block size of N.

In a fifth aspect, examples of the present invention describe a non-transitory tangible computer program product comprising executable code stored therein for polar decoding according to the fourth aspect.

Although examples of the invention are described with reference to a soft kernal encoded block having a block size of N configured to provide one or more soft bits to a polar decoder kernel, and a recovered kernal information block having a block size of N configured to output one or more recovered kernal information bits, it is envisaged that in other examples the described polar decoder kernel may operate as an inflexible decoder that only supports one block size of N.

Examples of the invention describe a mechanism to provide a seamless flow of data through a polar decoder. In some examples, the seamless flow of data through a polar decoder may be achieved through a combination of three different design aspects: first an improved operation of the datapaths (described in the datapath sections), secondly the interfacing of the datapaths with the memory (described in the memory sections), and thirdly the control of this interfacing and the addressing of the memory (described in the controller section). A skilled artisan will appreciate that achieving a seamless flow of data has influenced many design decisions and has proven to be the biggest challenge in the implementation of a polar decoder.

Although examples of the invention are described with reference to a use of LLR memory blocks, it is envisaged that these memory blocks are used to store any form of soft bits, and the use of LLR memory blocks to store soft bits as LLRs is used for explanatory purposes only.

Although examples of the invention are described with reference to an integrated circuit implementation within the application of a wireless communication receiver, it is envisaged that in other examples, the invention may be applied in other implementations and in other applications. For example, the circuits and concepts herein described may be composed as a hardware implementation within an Application Specific Integrated Circuit, an Application Specific Instruction Set Processor, an Application Specific Standard Product, a Field Programmable Gate Array, a General Purpose Graphical Processing Unit, System on Chip, Configurable Processor, for example. Similarly, it is envisaged that in other examples, a software implementation may be composed within a Central Processing Unit, a Digital Signal Processor or a microcontroller, for example. Besides wireless communication receivers, the invention may be composed into a wireless communication transceiver, or a communication device for other communication channels, such as optical, wired or ultrasonic channels. Furthermore, the invention may be composed into a storage device, in order to provide FEC for data recovered from optical, magnetic, quantum or solid-state media, for example.

Examples of the present invention further provide a method and architecture to decode information according to the principles of polar decoding, for the purpose of providing FEC during communication over unreliable channels or during storage in unreliable media. Examples of the present invention further provide a method and architecture to provide flexible support for information blocks that comprise a number of bits that varies from block to block.

In particular, examples of the present invention decompose a polar code graph into several columns, which each comprise a different set of one or more consecutive stages. Each column is further decomposed into several rows, which may be further decomposed into several sub-rows. The columns and their constituent rows are processed one after another, in an order that obeys the data dependencies of the polar decoding process and which revisits some rows in some columns several times. The processing of each row in each column comprises several steps, during which the sub-rows within the row are processed one after another.

Some examples of the present invention are described with reference to the New Radio (NR) standard, which is presently being defined by the 3rd Generation Partnership Project (3GPP) as a candidate for 5th Generation (5G) mobile communication. Presently, polar encoding and decoding has been selected to provide FEC in the uplink and downlink control channels of the enhanced Mobile BroadBand (eMBB) applications of NR, as well as in the Physical Broadcast Channel (PBCH). Polar encoding and decoding has also been identified as candidates to provide FEC for the uplink and downlink data and control channels of the Ultra Reliable Low Latency Communication (URLLC) and massive Machine Type Communication (mMTC) applications of NR. Alternatively, some examples of the invention are described without reference to a particular standardised application. More broadly, the invention may be applied in any future communication standards that select polar encoding and decoding to provide FEC. Furthermore, the invention may be applied in non-standardised communication applications, which may use polar encoding and decoding to provide FEC for communication over wireless, wired, optical, ultrasonic or other communication channels. Likewise, the invention may be applied in storage applications, which use polar encoding and decoding to provide FEC in optical, magnetic, quantum, solid state and other storage media.

In some examples, the circuits and functions herein described may be implemented using discrete components and circuits, whereas in other examples the operations may be performed in a signal processor, for example in an integrated circuit.

Because the illustrated embodiments of the present invention may, for the most part, be implemented using electronic components and circuits known to those skilled in the art, details will not be explained in any greater extent than that considered necessary as illustrated below, for the understanding and appreciation of the underlying concepts of the present invention and in order not to obfuscate or distract from the teachings of the present invention.

DETAILED DESCRIPTION OF FIGURES

Referring now to FIG. 1, a top-level schematic of a communication unit 116 that includes a polar encoder and polar decoder is illustrated, adapted according to examples of the invention. In this example of a communication unit 116, a skilled artisan will appreciate that a number of other components and circuits (such as frequency generation circuits, controllers, amplifiers, filters, etc.) are not shown for simplicity purposes only. In other examples, it is envisaged that the block 116 may take the form of an integrated circuit comprising the polar decoder (and in some instances the block conditioning and polar decoding processing functionality) as well, for example for use in a communication unit, storage unit or any electronic device that is designed to use polar decoding. In other examples, it is envisaged that the block 116 may take the form of software running on a general purpose computation processor.

A polar decoder comprises three successive components, namely information block conditioning 112, the polar decoder kernal 111 and the encoded block conditioning 110. These components are discussed in the following paragraphs. In order to provide context to the present discussion, FIG. 1 illustrates the communication or storage channel 108, as well as the corresponding components of the polar encoder, namely information block conditioning 101, the polar encoder kernal 102 and encoded block conditioning 103, although these are operated in the reverse order. As will be discussed in the following paragraphs, the polar decoder operates on the basis of a recovered information block 115, recovered kernal information block 114, soft kernal encoded block 113 and soft encoded block 109. Correspondingly, the polar encoder operates on the basis of an information block 109, kernal information block 105, kernal encoded block 106 and encoded block 107, although these are processed in the reverse order.

To understand the operation of the polar decoder, and in particular the polar decoder kernal 111, it is first worth considering the operation of the polar encoder kernal 102. In a context of a polar encoder, the input to the information block conditioning component 101 may be referred to as an information block 104, having a block size of K. More specifically, this information block is a row vector a=[a_(i)]_(i=0) ^(K-1) comprising K information bits, where a_(i)∈{0, 1}. The information block conditioning component 101 interlaces the K information bits with N−K redundant bits, which may be frozen bits [1], Cyclical Redundancy Check (CRC) bits [2], Parity Check (PC)-frozen bits [3], User Equipment Identification (UE-ID) bits [4], or hash bits [5], for example.

Here, frozen bits may always adopt a logic value of ‘0’, while CRC or PC-frozen bits or hash bits may adopt values that are obtained as functions of the information bits, or of redundant bits that have already been interlaced earlier in the process. The information block conditioning component 101 generates redundant bits and interlaces them into positions that are identified by a prescribed method, which is also known to the polar decoder. The information block conditioning component 101 may also include an interleaving operation, which may implement a bit-reversal permutation [1] for example. The output of the information block conditioning component 101 may be referred to as a kernal information block 105, having a block size of N. More specifically, this kernal information block 105 is a row vector u=[u_(j)]_(j=0) ^(N-1) comprising N kernal information bits, where u_(j)∈{0, 1}. Here, the information block conditioning must be completed such that N is a power of 2 that is greater than K, in order to provide compatibility with the polar encoder kernal, which operates on the basis of a generator matrix having dimensions that are a power of 2, as will be discussed below. The input to the polar encoder kernal 102 is a kernal information block u 105 and the output of the polar encoder kernal 102 may be referred to as a kernel encoded block 106, having a block size that matches the kernal block size N. More specifically, this kernal encoded block 106 is a row vector: x=[x_(j)]_(j=0) ^(N-1) comprising N kernal encoded bits, where x_(j)∈{0, 1}. Here, the kernal encoded block 106 is obtained according to the modulo-2 matrix multiplication x=uF^(⊕n), where the modulo-2 sum of two bit values may be obtained as their XOR. Here, the generator matrix F^(⊕n) is given by the [n=log 2(N)]th Kronecker power of the kernal matrix:

$F = {\begin{bmatrix} 1 & 0 \\ 1 & 1 \end{bmatrix}.}$

Note that successive Kronecker powers of the kernal matrix may be obtained recursively, where each power F^(⊕n) is obtained by replacing each logic ‘1’ in the previous power F^(⊕(n−1)) with the kernal matrix and by replacing each logic ‘0’ with a 2×2 zero matrix. Accordingly, the n^(th) Kronecker power F^(⊕n) of the kernal matrix has dimensions of 2^(n)×2^(n). For example,

${F^{\otimes 2} = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 1 & 1 & 0 & 0 \\ 1 & 0 & 1 & 0 \\ 1 & 1 & 1 & 1 \end{bmatrix}},{F^{\otimes 3} = \begin{bmatrix} 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\ 1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 \\ 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 1 & 1 & 0 & 0 & 1 & 1 & 0 & 0 \\ 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 \\ 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 \end{bmatrix}}$ Here, u=[1011] gives x=u F^(⊕2)=[1101] and u=[11001001] gives x=u F^(⊕3)=[00110111].

A skilled artisan will appreciate that the level of integration of circuits or components may be, in some instances, implementation-dependent. Furthermore, it is envisaged in some examples that a signal processor may be included in a communication unit 116 and be adapted to implement the encoder and decoder functionality. Alternatively, a single processor may be used to implement a processing of both transmit and receive signals, as shown in FIG. 1, as well as some or all of the baseband/digital signal processing functions. Clearly, the various components, such as the described polar encoder, within a wireless or wired communication unit 116 can be realized in discrete or integrated component form, with an ultimate structure therefore being an application-specific or design selection.

In some examples, the operation of the polar encoder kernal 102 may be represented by a graphical representation 201, 202, 203 of the generator matrix F^(⊕n), which is exemplified in FIG. 2. Referring now to FIG. 2 an example graphical representation 200 of the generator matrices F 201, F^(⊕2) 202 and F^(⊕3) 203 are illustrated according to examples of the invention. The graphical representations 201, 202, 203 of the generator matrix F^(⊕n) are examples of small polar code graphs, whereas in general, the polar code graphs may be much bigger and have any dimension n>0. Thus, the example in FIG. 2 illustrates a much more simplified arrangement than exists in practice, purely for the purpose of explanation and not to obfuscate the description of the invention.

Here, each modulo-2 addition ⊕ 204 may be implemented using a binary eXclusive-OR (XOR) operation. Note that the graph comprises ‘N’ inputs on its left edge 205 and ‘N’ outputs on its right edge 206, corresponding to the ‘N’ kernal information bits of ‘u’ 105 and the ‘N’ kernal encoded bits of ‘x’ 106. The graphical representations of the generator matrices F 201, F^(⊕2) 202 and F^(⊕3) 203 comprise n=log 2(N) stages 207, each of which comprises N/2 vertically aligned XORs 204, giving a total of N log 2(N)=2 XORs. Note that there are data dependencies between successive stages 207 that enforce a left to right processing schedule. More specifically, the data dependencies prevent the computation of the XORs in a particular stage 207 until after the XORs in the stage 207 to its left have been computed.

In some examples, in common with the recursive nature of successive Kronecker powers F^(⊕n), successive graphical representations of these generator matrices also have recursive relationships. More specifically, the graphical representation 200 for a polar encoding kernal operation having a kernal block size of N=2 201 comprises a single stage 207, containing a single XOR 204. Notably, in the example polar encoder, the first of the N=2 kernal encoded bits is obtained as the XOR of the N=2 kernal information bits, while the second kernal encoded bit is equal to the second kernal information bit. For greater kernel block sizes ‘N’, the graphical representation may be considered to be a vertical concatenation of two graphical representations for a kernal block size of N/2, followed by an additional stage 207 of XORs. In analogy with the N=2 kernal described above, the first N/2 of the N kernal encoded bits are obtained as XORs of corresponding bits from the outputs of the two N/2 kernals, while the second N/2 of the kernal encoded bits are equal to the output of the second N/2 kernal.

In this example, the input to the encoded block conditioning component 103 of the polar encoder is a kernal encoded block x 106 and its output may be referred to as an encoded block 107, having a block size of M. More specifically, this encoded block is a row vector comprising M encoded bits b=[b_(k)]_(k=0) ^(M-1), where b_(k)∈{0, 1}.

Here, the resultant polar coding rate is given by R=K/M, where the encoded block conditioning 103 must be completed such that ‘M’ is greater than ‘K’. The encoded block conditioning component 103 may use various techniques to generate the ‘M’ encoded bits in the encoded block b 107, where ‘M’ may be higher or lower than ‘N’. More specifically, repetition [6] may be used to repeat some of the ‘N’ bits in the kernel encoded block ‘x’, while shortening or puncturing techniques [6] may be used to remove some of the ‘N’ bits in the kernel encoded block ‘x’. Note that shortening removes bits that are guaranteed to have logic values of ‘0’, while puncturing removes bits that may have either of logic ‘0’ or ‘1’ values. The encoded block conditioning component may also include an interleaving operation. Following polar encoding, the encoded block ‘b’ 107 may be provided to a modulator, which transmits it over a communication channel 108.

Referring now to FIG. 3 an example polar encoding process, using an extension of the graphical representation 300 of the generator matrix F^(⊕3) 203, illustrates the example where a particular frozen bit pattern is used to convert the K=4 information bits a=[1001] 104 into the M=8 encoded bits b=[00001111] 107. More specifically, information block conditioning 101 is used to convert the K=4 information bits a=[1001] 104 into the N=8 kernal information bits u=[00010001] 105. These are then converted into the N=8 kernal encoded bits x=[00001111] 106 by the polar encoder kernal 102 using the polar code graph 203. Here, the input paths can be traced through the various XOR operations to identify the output. Finally, encoded block conditioning 103 preserves all kernal encoded bits, to provide the M=8 encoded bits b=[00001111] 107.

In the receiver, the demodulator's role is to recover information pertaining to the encoded block. However, the demodulator is typically unable to obtain absolute confidence about the value of the M bits in the encoded block 107, owing to the random nature of the noise in the communication channel 108. The demodulator may express its confidence about the values of the bits in the encoded block 107 by generating a soft encoded block 109, having a block size of M. More specifically, this soft encoded block 109 is a row vector comprising M encoded soft bits b=[b_(k)]_(k=0) ^(M-1). Each soft bit may be represented in the form of a Logarithmic Likelihood Ratio (LLR):

${\overset{\sim}{b_{k}} = {\ln\left\lbrack \frac{\Pr\left( {b_{k} = 0} \right)}{\Pr\left( {b_{k} = 1} \right)} \right\rbrack}};$

where Pr(b_(k)=‘0’) and Pr(b_(k)=‘1’) are probabilities that sum to ‘1’.

Here, a positive LLR {tilde over (b)}_(k) indicates that the demodulator has greater confidence that the corresponding bit b_(k) has a value of ‘0’, while a negative LLR indicates greater confidence in the bit value ‘1’. The magnitude of the LLR expresses how much confidence, where an infinite magnitude corresponds to absolute confidence in this bit value, while a magnitude of ‘0’ indicates that the demodulator has no information about whether the bit value of ‘0’ or ‘1’ is more likely.

In an alternative approach, each soft bit may be represented by a pair of Logarithmic Likelihoods (LLs): {tilde over (b)} _(k)(0)=ln[Pr(b _(k)=0)] {tilde over (b)} _(k)(1)=ln[Pr(b _(k)=1)]

A polar decoder comprises three successive components, namely encoded block conditioning 110, the polar decoder kernal 111 and information block conditioning 112, as shown in FIG. 1. These components are discussed in the following paragraphs.

The input to the encoded block conditioning component 110 of the polar decoder is a soft encoded block {tilde over (b)} 109 and its output may be referred to as a soft kernal encoded block 113, having a block size of N. More specifically, this soft kernal encoded block 113 is a row vector comprising ‘N’ kernal encoded LLRs {circumflex over (x)}=[{circumflex over (x)}_(j)]_(j=0) ^(N-1). In order to convert the M encoded LLRs into ‘N’ kernal encoded LLRs, infinite-valued LLRs may be interlaced with the soft encoded block 109, to occupy the positions within the soft kernal encoded block that correspond to the ‘0’-valued kernal encoded bits that were removed by shortening in the polar encoder. Likewise, ‘0’-valued LLRs may be interlaced with the soft encoded block 109, to occupy the positions where kernal encoded bits were removed by puncturing. In the case of repetition, the LLRs that correspond to replicas of a particular kernal encoded bit may be summed and placed in the corresponding position within the soft kernal encoded block 109. A corresponding deinterleaving operation may also be performed, if interleaving was employed within the encoded block conditioning component 103 of the polar encoder.

The input to the polar decoder kernal 111 is a soft kernal encoded block {tilde over (x)} 113 and its output may be referred to as a recovered kernal information block 114, having a block size of ‘N’. More specifically, this recovered kernal information block 114 is a row vector comprising ‘N’ recovered kernal information bits û=[û_(j)]_(j=0) ^(N-1), where û_(j)∈{0, 1}. In some examples, he polar decoder kernal 111 may operate using various different algorithms, including Successive Cancellation (SC) decoding [1] and Successive Cancellation List (SCL) decoding [7].

The input to the information block conditioning component 112 of the polar decoder is a recovered kernal information block 114 and its output may be referred to as a recovered information block 115, having a block size of ‘K’. More specifically, this recovered information block 115 is a row vector â=[â_(i)]_(i=0) ^(K-1) comprising ‘K’ recovered information bits, where â_(i)∈{0, 1}. The recovered information block may be obtained by removing all redundant bits from the recovered kernal information block û 114. A corresponding deinterleaving operation may also be performed, if interleaving was employed within the information block conditioning component 101 of the polar encoder.

1) Sc Decoding:

A polar decoder kernal that operates on the basis of SC decoding may be considered to have a similar graph structure 201, 202, 203 to a polar encoder, as illustrated in FIG. 2. It may be observed that each stage 207 of the graph comprises N/2 basic computation units, which resemble the N=2 graph 201. More specifically, each basic computation unit has two connections on its left-hand edge, which connect to basic computation units in the stage 207 immediately to the left, or which connect to the left-hand edge of the graph 205 if there are no stages to the left. These connections on the left-hand edge of the basic computation unit are horizontally-aligned with two connections on its right-hand edge, which connect to basic computation units in the stage 207 immediately to the right, or which connect to the right-hand edge of the graph 206 if there are no stages to the right. Within the basic computation unit, the first of the two right-hand connections is connected via an XOR 204 to the two-left hand connections, while the second right-hand connections is directly connected to the second left-hand connection. In the left-most stage of the graph, the two connections on the left-hand and right-hand edges of each basic computation unit are vertically consecutive to each other. But in the other stages, the two connections of each basic computation unit are vertically separated from each other by an offset that doubles in each successive stage 207.

An SC decoder performs computations pertaining to the basic computation units, according to a sequence that is dictated by data dependencies. More specifically, there are three types of computations that can be performed for a particular basic computation unit, depending on the availability of LLRs provided on the connections 403, 404 on its right-hand edge, as well as upon the availability of bits provided on the connections 401, 402 on its left-hand edge.

The first occasion when a basic computation unit can contribute to the SC decoding process is when an LLR has been provided by both of the connections 403, 404 on its right-hand edge. As shown in FIG. 4(a), we refer to the first and second of these two LLRs as {tilde over (x)}_(a) and {tilde over (x)}_(b), respectively. This enables the basic computation unit to compute an LLR {tilde over (x)}_(c) for the first 401 of the two connections on its left-hand edge, according to the f function:

$\begin{matrix} \begin{matrix} {{\overset{\sim}{x}}_{c} = {f\left( {{\overset{\sim}{x}}_{a},{\overset{\sim}{x}}_{b}} \right)}} \\ {= {2{\tanh^{- 1}\left( {{\tanh\left( {{\overset{\sim}{x}}_{a}/2} \right)}{\tanh\left( {{\overset{\sim}{x}}_{b}/2} \right)}} \right)}}} \\ {{\approx {{{sign}\left( {\overset{\sim}{x}}_{a} \right)}{{sign}\left( {\overset{\sim}{x}}_{b} \right)}{\min\left( {{{\overset{\sim}{x}}_{a}},{{\overset{\sim}{x}}_{b}}} \right)}}},} \end{matrix} & \begin{matrix} \; \\ {\;(1)\;} \\ (2) \end{matrix} \end{matrix}$

where sign(⋅) returns ‘−1’ if its argument is negative and ‘+1’ if its argument if positive.

Later in the SC decoding process, a bit ũ_(a) will be provided on the first 401 of the connections on the left-hand edge of the basic computation unit, as shown in FIG. 4(b). Together with the LLRs {tilde over (x)}_(a) and {tilde over (x)}_(b) that were previously provided using the connections 403, 404 on the right-hand edge, this enables the basic computation unit to compute an LLR {tilde over (x)}_(d) for the second 402 of the two connections on its left-hand edge, according to the g function:

$\begin{matrix} {\begin{matrix} {{\overset{\sim}{x}}_{d} = {g\left( {{\overset{\sim}{x}}_{a},{\hat{x}}_{b},{\hat{u}}_{a}} \right)}} \\ {= {{\left( {- 1} \right)^{{\hat{u}}_{a}}{\overset{\sim}{x}}_{a}} + {{\overset{\sim}{x}}_{b}.}}} \end{matrix}\quad} & (3) \end{matrix}$

Later still, a bit ũ_(b) will be provided on the second 402 of the connections on the left-hand edge of the basic computation unit, as shown in FIG. 4(c). Together with the bit ũ_(a) that was previously provided using the first 401 of the connections on the left-hand edge, this enables the partial sum computation of bits ũ_(c) and ũ_(d) for the first 403 and second 404 connections on the right-hand edge of the basic computation unit, where: ũ _(c)=XOR(ũ _(a) ,ũ _(b)),  (4) ũ _(d) =ũ _(b)  (5)

As may be appreciated from the discussions above, the f function of (1) or (2) may be used to propagate LLRs from right-to-left within the graph, while the partial sum computations of (4) and (5) may be used to propagate bits from left-to-right and while the g function of (3) may be used to switch from propagating bits to propagating LLRs.

In order that LLRs can be propagated from right to left, it is necessary to provide LLRs on the connections on the right-hand edge 206 of the graph. This is performed at the start of the SC decoding process, by providing successive LLRs from the soft kernal encoded block {tilde over (x)} 113 on successive connections on the right-hand edge 206 of the graph. Likewise, it is necessary to provide bits on the connections of the left-hand edge 205 of the graph, in order to facilitate the propagation of bits from left to right. Here, a further data dependency beyond those described above is imposed. If the position of a particular connection on the left-hand edge of the graph corresponds to the position of an information bit in the kernal information block u 105, then the bit that is input into that connection depends on the LLR that is output from that connection. More specifically, if a positive LLR is output on the connection, then a value of 0 may be selected for the corresponding bit of the recovered kernal information block ũ 114 and then input into the connection. Meanwhile, a negative LLR allows a value of ‘1’ to be selected for the corresponding bit of the recovered kernal information block 114 and then input into the connection. In the case of a connection corresponding to a redundant bit within the kernal information block u 105, the value of that redundant bit may be input into the connection as soon as it is known. Here, the value of frozen and UE-ID bits may be known before the SC decoding process begins, but the value of CRC, PC and hash bits may not become available until related information bits have been recovered.

In combination, the data dependencies described above impose a requirement for the information bits within the recovered kernal information block 114 to be obtained one at a time on the connections on the left edge 205 of the graph, in order from top to bottom. More specifically, the SC decoding process begins by using the f function (1) or (2) to propagate LLRs from the right hand edge 206 of the graph, to the top connection on the left-hand edge 205 of the graph, allowing the first bit to be recovered. Following this, each successive bit from top to bottom is recovered by using the partial sum computations of (4) and (5) to propagate bits from left to right, then using the g function of (3) for a particular basic computation unit to switch from bit propagation to LLR propagation, before using the f function to propagate LLRs to the next connection on the left-hand edge 205 of the graph, allowing the corresponding bit to be recovered. This process is illustrated in the example of FIG. 5.

FIG. 5 illustrates an example of an SC decoding process, using a graphical representation of a generator matrix F^(⊕3) 203 for a case where a particular frozen bit pattern is used to convert a particular vector ˜b of M=8 encoded LLRs 109 into the K=4 recovered information bits {circumflex over ( )}a=[1001] 115, according to example embodiments of the invention. The LLRs obtained using the f and g functions of equations (2) and (3) are shown above each connection. The bits obtained using the partial sum computations of equations (4) and (5) are shown below each connection. The accompanying numbers in parenthesis identify the step of the SC decoding process where the corresponding LLR or bit becomes available.

2) SCL Decoding:

In one example of the herein described SC decoding process, the value selected for each bit in the recovered information block 115 depends on the sign of the corresponding LLR, which in turn depends on the values selected for all previous recovered information bits. If this approach results in the selection of the incorrect value for a particular bit, then this will often result in the cascading of errors in all subsequent bits. The selection of an incorrect value for an information bit may be detected with consideration of the subsequent frozen bits, since the decoder knows that these bits should have values of ‘0’. More specifically, if the corresponding LLR has a sign that would imply a value of ‘1’ for a frozen bit, then this suggests that an error has been made during the decoding of one of the preceding information bits. However, in the SC decoding process, there is no opportunity to consider alternative values for the preceding information bits. Once a value has been selected for an information bit, the SC decoding process moves on and the decision is final.

This motivates SCL decoding [7], which enables a list of alternative values for the information bits to be considered. As the decoding process progresses, it considers both options for the value of each successive information bit. More specifically, an SCL decoder maintains a list of candidate kernal information blocks, where the list and the kernal information blocks are built up as the SCL decoding process proceeds. At the start of the process, the list comprises only a single kernal information block having a length of zero bits. Whenever the decoding process reaches a frozen bit, a bit value of 0 is appended to the end of each kernal information block in the list. However, whenever the decoding process reaches an information bit, two replicas of the list of candidate kernal information blocks is created. Here, the bit value of ‘0’ is appended to each block in the first replica and the bit value of 1 is appended to each block in the second replica. Following this, the two lists are merged to form a new list having a length which is double that of the original list. This continues until the length of the list reaches a limit L, which is typically chosen as a power of two. From this point onwards, each time the length of the list is doubled when considering an information bit, the worst L among the 2L candidate kernal information blocks are identified and pruned from the list. In this way, the length of the list is maintained at L until the SCL decoding process completes.

Here, the worst candidate kernal information blocks are identified by comparing and sorting metrics that are computed for each block [8], based on the LLRs obtained on the left-hand edge 205 of the polar code graph. These LLRs are obtained throughout the SCL decoding process by using separate replicas of the partial sum computations of (4) and (5) to propagate the bits from each candidate kernal information block into the polar code graph, from left to right. Following this, separate replicas of the g and f computations of (1)-(3) may be used to propagate corresponding LLRs from right to left, as in the herein described example SC decoding process. The metric associated with appending the bit value û_(l,j) in the position j∈[0, N−1] to the candidate kernal information block I is given by:

$\begin{matrix} \begin{matrix} {{\phi_{l,j}\left( {\hat{u}}_{l,j} \right)} = {\phi_{l,{j - 1}} + {\ln\left( {1 + e^{{- {({1 - {2\hat{u}}})}_{l,j}}{\overset{\sim}{x}}_{l,j}}} \right)}}} \\ {\approx \left\{ {\begin{matrix} \phi_{l,{j - 1}} & {{{if}\mspace{14mu}{\hat{u}}_{l,j}} = {\frac{1}{2}\left( {1 - {{sign}\left( {\overset{\sim}{x}}_{l,j} \right)}} \right)}} \\ {\phi_{l,{j - 1}} + {{\overset{\sim}{x}}_{l,j}}} & {otherwise} \end{matrix},} \right.} \end{matrix} & \begin{matrix} (6) \\ \; \\ (7) \end{matrix} \end{matrix}$

where {tilde over (x)}_(l,j) is the corresponding LLR and ϕ_(l,j−1) is the metric that was calculated for the candidate kernal information block in the previous step of the SCL decoding process. Note that since the metrics accumulate across all bit positions j∈[0, N−1], they must be calculated for all L candidate kernal information blocks whenever a frozen bit value of ‘0’ is appended, as well as for all 2L candidates when both possible values of an information bit are considered. In the latter case, the 2L metrics are sorted and L candidates having the highest values are identified as being the worst and are pruned from the list.

Following the completion of the SCL decoding process, the candidate kernal information block having the lowest metric may be selected as the recovered kernal information block 114. Alternatively, in CRC-aided SCL decoding [9], all candidates in the list that do not satisfy a CRC are pruned, before the candidate having the lowest metric is selected and output.

Proposed Polar Decoder Kernal

Referring now to FIG. 6, an example schematic of the proposed polar decoder kernal 1600 is illustrated for the case where C_(max)=5, according to example embodiments of the invention. The proposed polar decoder kernal 111 comprises datapath 1601, 1602, 1603, memory 1604, 1605, and controller 1606 components. More specifically, an inner datapath 1601, an outer datapath 1602 and C_(max)−2 replicas of the partial sum datapath 1603 are employed. Furthermore, C_(max)−1 bit memory blocks 1605 are employed, together with C_(max) LLR memory blocks 1604. In contrast to known processor architectures for implementing a decoder, examples of the present invention can flexibly group all stages in the polar code graph into a number of columns in the range 1 to C_(max), depending on the kernal block size N at run-time, where in some examples C_(max) may be selected at design time. By contrast, some prior art always uses a fixed number of columns that does not vary with kernal block size, whilst some prior art can only group the left-most stages into a column, with the requirement for all other stages to remain individual.

In this way, examples of the present invention accrue the advantage of using columns, which is that the number of steps required to complete the polar decoding process is reduced. Examples of the present invention also retain the flexibility to support long kernal block sizes N, without the requirement for columns having excessive widths and therefore hardware requirements. Likewise, some examples of the present invention retain the flexibility to support short kernal block sizes N, whilst retaining high utility of the inner datapath hardware, and therefore maintaining hardware efficiency.

More specifically, rather than processing one stage of the polar code graph at a time, the proposed architecture achieves a higher degree of parallelism by processing the several consecutive stages within each column at once. This parallel processing can be fully exploited throughout the majority of the f and g computations, achieving greater hardware utility than line and semi-parallel architectures. Furthermore, since several consecutive stages are processed at once, memory is only required at the interfaces between each pair of consecutive groupings of stages, rather than at the interfaces between each pair of consecutive individual stages. This significantly reduces the overall memory requirement of the proposed architecture relative to previous implementations, which is particularly impactful since memory is the biggest contributor to hardware resource usage. Finally, a simple mechanism for propagating partial sum bits is proposed, which is also impactful since partial sum propagation is the second biggest contributor to hardware resource usage in previous implementations.

More specifically, under the control of the controller 1606, each of the inner datapath 1601, the outer datapath 1602 and the partial sum datapaths 1603 may be directed to process one sub-row of one row of one column in each step of the polar encoder kernal operation. Here, the inputs to the datapath 1601, 1602 or 1603 are read from the LLR and/or bit memory blocks 1604 and 1605 that reside at the appropriate interface on one or other edge on either side of the current column, depending on whether information is propagating from left-to-right or right-to-left in the polar code graph. Likewise, the outputs of the datapath 1601, 1602 or 1603 are written to the LLR and/or bit memory blocks 1604 and 1605 that reside at the appropriate interface on either side of the current column, depending on the direction of information flow. In this way, bits or LLRs can be passed between processing performed in adjacent columns by reading and writing to the same memory block 1604 or 1605.

The LLRs and bits are arranged within these memory blocks 602, 603 in a manner that allows the datapaths 1601, 1602 or 1603 to perform seamless read and write operations, without the requirement for complex interconnection networks or complex control signals.

Architecture

The proposed polar decoder kernal 111 enables the flexible decoding of one recovered kernal information block 114 at a time, where successive recovered kernal information blocks can have kernal block sizes N that can vary from block to block.

More specifically, the kernal block size N can adopt the value of any power of two between 2 and N_(max), where N_(max) is a parameter that is fixed at design time. At the start 1801 of the polar decoding process, the soft kernal encoded block {circumflex over (x)}=[{circumflex over (x)}_(j)]_(j=0) ^(N-1) 113 is loaded 1802 into the LLR input 1607 of the polar decoder kernal 111, over a series of N/min(N, n_(l)) consecutive steps. The LLR input 1607 has a width that can accept n_(l) LLRs in each step, where the parameter n_(l) is fixed at design time. Here, each LLR may be represented using a two's complement fixed-point number, having a bit width that is fixed at design time. In the case where N<n_(l), an equal number of zero-valued LLRs are inserted after each LLR in the soft kernal encoded block 113, in order to increase its length to n_(l) before it is provided to the proposed polar decoder kernal 111. During the polar decoding process, the redundant bit patterns and the corresponding redundant bit values are provided to corresponding inputs 1608 of the proposed polar decoder kernal 111. Each of these inputs has a width that can accept 2^(s) ^(o) pattern bits or redundant bits in each step, which are provided to the proposed polar decoder kernal 111 using an on-demand basis, according to the needs of the polar decoding process. In the case where N<2^(s) ^(o) , asserted frozen bit flags are appended to the frozen bit pattern, in order to increase its length to 2^(s) ^(o) .

Following the completion of the polar decoding process, a series of N/min(N, n_(b)) consecutive steps is used to output 1803 the recovered kernal information block û=[û_(j)]_(j=0) ^(N-1) 114 on the bit output 1609 of the proposed polar decoder kernal 111, which has a width of n_(b) bits. In the case where N<n_(c), zero-valued bits may be removed from the end of the output 1609 of the proposed polar decoder kernal 111. When decoding a soft kernal encoded block 113 having a block size of N, one described example of the proposed polar decoder kernal 111 operates on the basis of a graph representation 201, 202, 203 of the polar code generator matrix F^(⊕n). Here, the n=log 2(N) stages 207 within the graph 201, 202, 203 are grouped into a number C of columns 1701, 1702, where each column comprises a particular number of consecutive stages 207. Each column 1701, 1702 may be referred to by its index c∈[0, C−1], where the left-most column 1701 has the index c=0 and the right-most column has the index c=C−1. The number of stages in each column 1701, 1702 may be expressed using the row vector s=[s_(c)]_(c=0) ^(C−1), where s₀ is the number of stages in the left-most column 1701 and s_(C−1) is the number of stages in the right-most column. Here, s must be chosen such that Σ_(c=0) ^(C−1) s_(c)=n. This is exemplified in FIG. 7 for the case where the graph representation of the generator matrix F^(⊗6) is grouped into C=4 columns 1701, 1702, comprising s=[1; 2; 2; 1] stages 207. In the proposed polar decoder kernal 111, the left-most column with the index c=0 is referred to as the outer column 1701, while the other columns having the indices c∈[1, C−1] are referred to as the set of inner columns 1702. The particular number of stages in each column 1701,1702 is selected depending on the kernel block size N, as well as the parameters s_(o) and s_(i), which are fixed at design time. Here, s_(o) specifies the maximum number of stages that may be accommodated in the outer column 1701, which can adopt any value in the range ‘0’ to n_(max)=log₂(N_(max)). Meanwhile s_(i) specifies the maximum number of stages that may be accommodated in each inner column 1702, which can adopt any value in the range 1 to n_(max)−s_(o). If the number of stages in the graph n=log 2(N) satisfies n≤s_(o), then the graph 201, 202, 203 is decomposed into only C=1 column, namely the outer column 1701, which will comprise s_(o)=n stages 207. Otherwise, the graph 201, 202, 203 is decomposed into C=┌(n−s_(o))/s_(i)┐+1 number of columns, where the outer column 1701 comprises s₀=s_(o) stages 207, the right-most inner column 1702 comprises s_(C−1)=n−s_(o)−(C−2)s_(i) stages 207 and all other inner columns 1702 comprise s_(c)=s_(i) stages 207. This is exemplified in FIG. 7, where s=[1; 2; 2; 1] results from s_(o)=1 and s_(i)=2 in the case where the graph 201, 202, 203 comprises n=6 stages 207. Note that in alternative arrangements, the n−s_(o) right-most stages 207 could be distributed among the C−1 inner columns 1702 using any other combination that satisfies s_(c)≤s_(i) for all c∈[1, C−1], although this requires modifications to the design described throughout this section.

Note that if the maximum number of stages in the graph n_(max)=log₂(N_(max)) satisfies n_(max)=s_(o), then the graph 201, 202, 203 will always be decomposed into only C_(max)=1 column 1701, comprising a maximum of s_(0,max)=n_(max) stages 207. Otherwise, the graph 201, 202, 203 is decomposed into a maximum of C_(max)=┌(n_(max)−s_(o))/s_(i)┐+1 number of columns 1701, 1702, where the outer column 1701 comprises a maximum of s_(0,max)=s_(o) stages 207, the right-most inner column 1702 comprises a maximum of s_(C−1,max)=n_(max)−s_(o)−(C_(max)−2)s_(i) stages 207 and all other inner columns 1702 comprise a maximum of s_(c,max)=s_(i) stages 207. The set of columns 1701, 1702 is associated with a vector of sub-code radixes r=[r_(c)]_(c=0) ^(C−1), where each sub-code radix is given by: r _(c)=2^(Σ) _(c′=0) ^(c) s _(c′).

Here, the sub-code radix r_(c) of a particular column 1701, 1702 quantifies the kernal block size N that would result if the graph 201, 202, 203 comprised only the stages 207 in that column and in the columns to its left. Note that the sub-code radix r_(c) each successive column 1701, 1702 grows from left to right. The corresponding maximum sub-code radixes are given by: r _(c,max)=2^(Σ) ^(c′=0) ^(c) ^(s) ^(c′) .

Each column 1701, 1702 comprises a number of rows, which may be expressed using the vector R=[R_(c)]_(c=0) ^(C−1), where the number of rows in a particular column is given by R_(c)=N/r_(c)

Here, each row 1703 comprises a sub-graph comprising s_(c) stages 207 and r_(c) consecutive connections on its left and right edges, which are horizontally-aligned. It may be observed in FIG. 7 that the row definition given above results in there being no interconnections between any pair of rows 1703 within any particular column 1701, 1702. Each row 1703 of each column 1701, 1702 may be visited one or more times by the polar decoding process, in order to perform XOR operations, or f and g functions, for example. More specifically, processing associated with particular rows in particular columns may be performed on more than one temporally-separated occasion during the polar decoding process, where each set of temporally-separated processing may be referred to as a ‘visit’ to the row. However, the visits to the rows 1703 in columns 1701, 1702 to the right of the graph 201, 202, 203 involve more computations than the visits within columns to the left of the graph, since the number of connections within the rows 1703 of each column r_(c) grows from left to right. However, it may be observed in FIG. 7 that the rows 1703 in the right-most columns may be decomposed into sub-rows 1704, which have no connections between each other. Owing to this, the computations associated with a particular visit to a row 1703 at a particular time during the polar decoding process may be spread over several consecutive steps, each of which performs computations 1804, 1805, 1806 for a different sub-row 1704 in the row 1703. In this way, the polar decoding process is completed one step at a time, where each step may correspond to one or more hardware clock cycles, depending on if and how pipelining is employed. By using more sub-rows 1704 per row 1703 in the columns 1702 to the right of the graph 201, 202, 203, the number of computations performed in each step of the decoding process can be maintained at a relatively constant level, irrespective of which column is being visited. Formally, the number of sub-rows that comprise each row 1703 of each column 1701, 1702 may be expressed using the vector S=[S_(c)]_(c=0) ^(C−1). Here, S_(c) must be a power of two and must not exceed r_(c)/2^(s) ^(c) in order to ensure that there are no connections between sub-rows 1704. Note that this implies that the rows 1703 in the outer column 1701 cannot be further decomposed into sub-rows 1704. Each sub-row 1704 comprises a sub-graph comprising s_(c) stages 207 and n_(c)=r_(c)/S_(c) horizontally-aligned connections on its left and right edges, which are vertically offset from each other by r_(c)/n_(c) positions. Here, n_(c) is referred to as the block size of the sub-row 1704, which must be a power of two in the range [2^(s) ^(c) , r_(c)]. In the proposed polar decoder kernal 111, the particular block size of the sub-rows 1704 in each inner column 1702 is selected as n_(c)=min(r_(c), n_(i)). Here, specifies the maximum inner sub-row block size, which is a parameter that is fixed at design time and which can adopt the value of any power of two in the range 2^(s) ^(i) to N_(max). Each row 1703 of each column 1701, 1702 is enclosed in a dashed box. The first sub-row 1704 in the first row 1703 of each column 1701, 1702 is highlighted in bold.

This is exemplified in FIG. 7, where S=[1; 1; 4; 8] results from n_(i)=8 in the case where the graph 201, 202, 203 comprises n=6 stages 207.

FIG. 8 illustrates an example flowchart of a decoding process employed by the proposed polar decoder kernal, whereby each cycle around the main loop of the flowchart corresponds to one step of the decoding process, according to example embodiments of the invention. The flowchart starts at 1801 and, at 1802, the LLRs of the soft kernal encoded block 113 are loaded into the proposed polar encoder kernal 111. At 1807, the current column index c is initialised as c=C−1, the current row indices y are initialised as a zero-valued vector of length C and the current sub-row index s is initialised as 0.

At 1808, the determination c>0 is used to identify if the current column is an inner column. If so, then the flowchart proceeds to 1809, where v=mod(y_(c−1),r_(c)/r_(c−1)) is determined to identify the index of the current visit to the current sub-row in the current row of the current column. Following this, at 1805, the partial sum datapaths 1 to c are used to propagate propagate partial sum bits from column 0 to the current column. Following this, at 1806, the inner datapath is used to process the current visit to the current sub-row in the current row of the current column. At 1813, the determination s=S_(c−1) is used to determine if the visit with index v has now been made to all sub-rows in the current row. If not, then the sub-row index s is incremented at 1812, so that the next sub-row will be visited next. The flowchart then returns to 1808, to continue processing the sub-rows in the current row of the current inner column.

By contrast, if it was determined at 1813 that the visit with index v has now been made to all sub-rows in the current row of the current inner column, then the flowchart proceeds to 1814. Here, the determination v=r_(c)/r_(c−1)−1 is used to determine if the last visit has now been made to all sub-rows in the current row of the current inner column. If not then the flow chart proceeds to 1818, or if so then the flowchart first proceeds to 1816, before advancing to 1818. At 1816, the row index for the current column is incremented, so that when the current inner column is visited again later in the polar decoding process, it will be the next row down that will be visited. At 1818, the current column index c is decremented, so that the column to the left will be visited next, be it the outer column or another of the inner columns. At 1821, the sub-row index s is reset to 0, so that the next visit to a row in an inner column will start with its top sub-row. Following this, the flow chart returns to 1808.

If, at 1808, the determination c>0 identifies that the current column is the outer column, then the flowchart proceeds to 1804. Here, the outer datapath is used to process the current row y₀ in the outer column. Following this, the detemination y₀=R₀−1 is used at 1810 to determine if the bottom row in the outer column has been visited. If not, then the flowchart proceeds to 1815, where the row index for the outer column is incremented, so that when the outer column is visited again later in the polar decoding process, it will be the next row down that will be visited. Next, a process is used in 1817, 1820 and 1819 to determine which of the inner columns should be visited next. In 1817, the column index c is initialised to that of the right-most inner column C−1. In 1819, c is continually decremented, until mod(y₀2^(so),r_(c−1))=0 at 1820. Following this, the flowchart proceeds to 1821, where the sub-row index s is reset to 0, before the flow chart returns to 1808.

By contrast, if it was determined at 1810 that the bottom row in the outer column has been visited, then the recovered kernel information block 114 is output from the proposed polar decoder kernal 111 and the process ends at 1811.

In some examples, the proposed polar decoder kernal 111 completes the decoding process in accordance with the data dependencies. As the decoding process proceeds, computations are performed for different rows 1703 in different columns 1701, 1702, according to a particular schedule, as illustrated in the flowchart of FIG. 8. Each row 1703 in the outer column 1701 will be visited once by the process, while each row 1703 of each particular inner column 1702 will be visited 2^(s) ^(c) times by the process, where s_(c) is the number of stages in that column. The decoding process begins by passing the LLRs of the soft kernal encoded block {tilde over (x)} 113 to the single row 1703 in the right-most column. The decoding process then uses the f function of (1) or (2) to perform calculations upon these LLRs during a first visit to this single row 1703 in the right-most column. Whenever a visit to a row 1703 in an inner column 1702 has been completed, it will pass the resultant LLRs to one of the connected rows 1703 in the column to the left, where the particular row 1703 is selected as the top-most one that has not been visited yet. The decoding process will then use the f function of (1) or (2) to perform calculations upon these LLRs during a first visit to this row 1703 in the column to the left. Whenever a visit 1804 to a row 1703 in the outer column 1701 has been completed, it will contribute bits to the recovered kernal information block û 114. Following this, the partial sum equations of (4) and (5) will be used to pass 1805 partial sum bits from this row 1703 in the outer column 1701 to the left-most inner column 1702 having a horizontally-aligned row 1703 where fewer than 2^(s) ^(c) visits have been completed so far. At the same time, the decoding process will perform a visit to this row 1703, in which the g function of (3) is used to combine these bits with the LLRs that were provided at the start of the first visit to the row 1703. Note that each visit to a row 1703 in an inner column 1702 may be performed spread over a number of consecutive steps of the decoding process, where each step 1806 operates on a different one of the sub-rows 1704 in the row 1703. Here, the sub-rows 1704 may be processed in any order, although the flowchart of FIG. 8 illustrates the case where they are processed from top to bottom. Here, the partial sum bits are propagated 1805 from the outer column 1701 to the sub-row 1704 in the inner column 1702 within the same step where they are used by the g function of (3), as discussed below. Note that this same approach may be used for both the SC and the SCL decoding processes. In the case of SCL decoding, each visit to each sub-row 1704 uses parallel processing to simultaneously perform the computations associated with all L candidate kernal information blocks in the list.

FIG. 9 illustrates an example timing diagram for the proposed polar decoder kernal, according to example embodiments of the invention.

As shown in FIG. 9, the total number of steps required to complete the decoding process may be obtained by combining the number of visits made to each row 1703 in each column 1701, 1702 with the number of sub-rows 1704 in each column, giving a total of N/r₀+Σ_(c=1) ^(C−1)2^(s) ^(c) N/min(r_(c), n_(i)) steps, as plotted in FIG. 10.

FIG. 10 illustrates an example plot of a number of steps required by the decoding process of the proposed polar decoder kernal, according to example embodiments of the invention. It plots the number of steps required by the decoding process of the proposed polar decoder kernal 111, as functions of the kernal block length N, the number of stages s_(o) in the outer datapath 1602, the number of stages s_(i) in the inner datapath 1601 and the block size n_(i) of the inner datapath. For the case of L=8 list decoding and for each combination of so, s_(i) and n_(i), ‘path’ quantifies the number of fixed-point adders in the critical datapath length, ‘outadd’ quantifies the number of fixed-point adders that must be laid out in the outer datapath 1602, ‘inadd’ quantifies the number of fixed-point adders that must be laid out in the inner datapath 1601. Furthermore, for the case of N_(max)=1024, ‘LLRmem’ quantifies the required LLR memory 1604 capacity in LLRs, while ‘bitmem’ quantifies the required bit memory 1605 capacity in bits, including the memory for the candidate kernal information blocks obtained by the outer datapath 1602.

Note that a further N/min(N, n_(i)) steps are required to load 1802 the LLRs of the soft kernal encoded block 113 into the proposed polar decoder kernal 111, before the decoding process can begin. Note that in an alternative example arrangement, the processing of the right-most column 1702 may begin towards the end of the loading 1802 of the soft kernal encoded block 113, thereby allowing some concurrency to be achieved, subject to a modification to the illustrated design. In the case of SC decoding, the recovered kernel information block 114 can be output 1803 from the proposed polar decoder kernal 111 concurrently with the processing of the outer column 1701 in the graph 201, 202, 203, n_(b)=2^(s) ^(c) bits at a time, albeit sporadically according to when the outer column 1701 is visited 1804 by the decoding process. However, in the case of SCL decoding, the outputting 1803 of the recovered kernal information block 114 cannot begin until after all processing has been completed and the best among the L candidate kernal information blocks has been selected. In this case, a further N/min(N, n_(b)) steps are required to output 1803 the recovered kernal information block 114. Each step may correspond to a single clock cycle in a hardware implementation, depending on if and how pipelining is applied.

The number of steps used by three parameterisations of the proposed polar decoder kernal is plotted as a function of the kernal block length N in FIG. 10. The legend of this figure also quantifies the computation and memory resources used by each parameterisation, as will be detailed in the following sections. As may be expected, fewer steps are used by parameterisations having more stages so in the outer datapath 1602, more stages s_(i) in the inner datapath 1601 and greater inner datapath block sizes n_(i). Although the datapaths of these faster parameterisations use more computation resources with longer critical paths, they tend to use less memory resources, since they use fewer columns. FIG. 10 compares the proposed polar decoder kernal with the line decoder of [14] and the semi-parallel decoder of [15], which have been parameterised to use the multi-bit technique of [26] to recover 2^(so) kernal information bits at a time. As shown in FIG. 10, the proposed polar decoder having the parameter s_(o)=2 completes the decoding process using fewer steps than the benchmarkers employing the same value of s_(o)=2. Furthermore, it uses fewer computation resources and it uses less than 25% of the amount of LLR memory. Furthermore, the proposed polar decoder kernal employs an elegant method for partial sum propagation, which has a small hardware overhead. Since LLR memory and the partial sum propagation are the two biggest contributors to hardware resource usage, it may be expected that the hardware efficiency of the proposed polar decoder may be four to five times better than that of state-of-the-art polar decoders.

This proposed approach can be considered to employ a conventional polar code graph 201, 202, 203 as the basis of LLR propagation using the f and g functions of (1)-(3). However, a novel rearrangement of the polar code graph 201, 202, 203 is employed as the basis of bit propagation 1805 using the partial sum equations of (4) and (5).

FIG. 11 illustrates an example rearranged graphical representation of the generator matrix F^(⊕6), for the case of employing C=4 columns comprising s=[1; 2; 2; 1] stages, according to example embodiments of the invention.

This rearranged graph is exemplified in FIG. 11, for an example where the graph 201, 202, 203 representation of the generator matrix F^(⊕6) has been decomposed into C=4 columns comprising s=[1; 2; 2; 1] stages 207. Here, it may be observed that the bottom r_(c−1) XORs in each stage 207 of each row 1703 of the inner columns 1702 have been removed, where r_(c−1) is the sub-code radix of the column to the left, as defined above. Instead, XORs 2101 have been introduced at the interface between each inner column 1702 and the column to its right. More specifically, each of the top r_(c)−r_(c−1) bits that are passed from each row 1703 of each inner column 1702 to the column to its right is XORed 2101 with a particular one of the bottom r_(c−1) bits that are passed from that row 1703. Here, the particular bit is identified such that both bits in each XORed pair have the same index modulo r_(c−1), where each bit index will be in the range 0 to N−1 before the modulo operation and 0 to r_(c−1)−1 after the modulo operation.

As shown in FIG. 6, the proposed polar decoder kernal 111 comprises inner datapath 1601, outer datapath 1602, partial sum datapath 1603, LLR memory block 1604, bit memory block 1605 and controller 1606 components. More specifically, while the proposed polar decoder kernal 111 comprises only a single instance of the outer datapath 1602 and inner datapath 1601, it comprises C_(max)−2 instances of the partial sum datapath 1603, C_(max)−1 instances of the bit memory block 1605 and C_(max) instances of the LLR memory block 1604. Here, the outer datapath 1602 is interfaced with the bit output of the polar decoder kernal 111 and can be considered to reside within the outer column 1701, which has the index c=0. Meanwhile, the inner datapath 1601 can be considered to reside within different inner columns 1702 having different indices c∈[1, C−1] during different steps of the decoding process. Furthermore, the partial sum datapath 1603 with the index c∈[1, C−2] can be considered to reside within the inner column 1702 of the polar code graph 201, 202, 203 having the corresponding index c.

Furthermore, an inner column 1702 having the index c∈[1, C−2] can be considered to interface with the column to its left via the bit memory block 1605 and LLR memory block 1604 having the index c, as well as to interface with the column to its right via the bit memory block 1605 and LLR memory block 1604 having the index c+1. Furthermore the right-most column 1702 having the index C−1 can be considered to interface with the LLR input 1607 of the proposed polar decoder kernel 111 via the LLR memory block 1604 having the index C_(max). As shown in FIG. 6, the outer datapath 1602, the bit memory blocks 1605 and the partial sum datapaths 1603 form a chain, which represent the C columns 1701, 1702 in the polar code graph 201, 202, 203. The inner datapath 1601 can take inputs from and provide outputs to different points in this chain, as the decoding process visits different inner columns 1702 in the graph 201, 202, 203. FIG. 6 also illustrates, in some example embodiments, a mechanism for bypassing 1610 the bit memory blocks 1605 in this chain. This is the mechanism alluded to above, which allows bits to propagate 1805 from the outer datapath 1602, through successive partial sum datapaths 1603 and into the inner datapath 1601 within a single step of the decoding process, irrespective of which inner column 1702 is being visited. Note that in the case of SCL decoding in some examples, the datapaths 1601, 1602, 1603 and memories 1604, 1605 have sufficient resources to perform the computation for all L candidate kernal information blocks in parallel.

The proposed polar decoder kernal 111 has significant differences to all previously proposed approaches to polar decoding. The programmable architecture of [10], [11] adopts a serial approach, which performs the computations associated with a single f or g function in each step, using a schedule that obeys the aforementioned data dependencies. By contrast, the proposed approach performs all computations associated with a sub-row 1704 in each step, resulting in a much higher parallelism, much higher throughput and much lower latency. The unrolled decoder of [12], [13] achieves a very high degree of parallelism by employing a different piece of dedicated hardware for each f or g computation in the polar decoding process. However, each step of a polar decoding process uses the hardware for only a single f or g computation, resulting in a high latency. While this approach can achieve a high throughput by overlapping many decoding processes at once, it suffers from a limited degree of flexibility. By contrast, the proposed approach is fully flexible, since its computation hardware can be reused for each sub-row 1704 in the polar code graph 201, 202, 203, even if they comprise fewer stages 207 or have smaller block sizes than those assumed by the hardware. The line decoder of [14] achieves a high degree of parallel processing, by simultaneously performing all f and g computations associated with the right-most stage 207 of a polar code graph 201, 202, 203 having particular dimensions. However, the aforementioned data dependencies may prevent this parallelism from being fully exploited when processing the other stages 207 in the graph 201, 202, 203. Instead, successively smaller subsets of the hardware may be reused to perform the processing of each successive stage 207 to the left, resulting in a poor hardware efficiency and flexibility. Motivated by this, the semi-parallel decoders of [8], [15]-[24] improve the hardware efficiency and flexibility by reducing the degree of parallel processing, requiring several processing steps to perform the computations for the right-most stages 207, but still suffering from being unable to exploit all parallelism for the left-most stages 207. By contrast, each step of the proposed approach achieves a high degree of parallelism by simultaneously performing computations that span not only up and down the length of each column, but also across the multiplicity of stages 207 in each column 1701, 1702. More specifically, the proposed approach uses a tree-structure to perform the computations for each sub-row 1704, which ensures that the full degree of parallelism is exploited in the typical case, irrespective of which column 1701, 1702 is being visited and irrespective of the graph dimensions. This enables a high degree of flexibility, a high hardware efficiency, a high throughput and a low latency.

While there are several previously proposed approaches to polar decoding that employ the concept of columns 1701, 1702, there are none that apply it in the fully generalised manner of the proposed polar decoder kernal 111, where an arbitrary number of columns 1701, 1702 may be employed, each comprising a potentially different and arbitrary number of stages 207. The tree structures of [14], [25]-[29] operate on the basis of a single column 1701 that comprises all stages 207 in the polar code graph 201, 202, 203, but this approach supports only a single kernal block length and can result in a large hardware resource requirement. The polar code graph 201, 202, 203 is decomposed into two columns 1701, 1702 comprising an equal number of stages 207 in the approach of [30], [31], but again this approach supports only a single kernal block length. By contrast, the approach of [32], [33] uses an outer column 1701 that may comprise several stages 207, but all other stages are processed separately, using the semi-parallel approach described above. In contrast to these approaches, the proposed polar decoder kernel 111 can benefit from the generalised application of columns 1701, 1702, owing to its novel memory architectures. These are necessary because particular groupings of bits and LLRs are written at the same time during the processing of one column 1701, 1702, but different groupings of bits and LLRs are read at the same time during the processing of the adjacent columns 1701, 1702. The proposed memory architectures seamlessly enable read and write operations using these groupings, ensuring that the correct groups of bits and LLRs are elegantly delivered to the right place at the right time. Furthermore, a significant memory reduction is facilitated by the proposed approach, since bits and LLRs are only stored at the boundary between each pair of consecutive columns 1701, 1702, rather than at the greater number of boundaries between each pair of consecutive stages 207.

These same novel memory architectures are also used as the basis of the partial sum propagation 1805 in the proposed polar decoder kernal 111, where a bypass mechanism 1610 is used to pass bits from the outer column 1701 to any of the inner columns 1702 in a single step of the decoding process. This is in contrast to the partial sum propagation methods that have been proposed previously. In [8], [15], [30], partial-sum update logic is used to accumulate different combinations of the decoded bits and a complicated interconnection network is used to deliver them to the processing of the corresponding g functions. This results in a large hardware overhead and a long critical path, which limits the achievable hardware efficiency, throughput and latency. By contrast, the feed-forward architecture of [19], [21], [28], [32], [34] uses dedicated hardware to propagate partial sum bits to each successive stage 207 of the polar code graph 201, 202, 203. However, the complexity of the feed-forward architecture grows rapidly for each successive stage 207, limiting the range of kernal block lengths that can be supported and limiting the hardware efficiency. By contrast, the approach of [17], [22], [27], [35] uses a simplified polar encoder kernal 102 to implement the partial sum, although this does not benefit from reusing calculations that are performed as a natural part of the decoding process, like in the proposed approach.

Datapaths

The proposed polar decoder kernal 111 uses dedicated hardware datapaths 1601, 1602, 1603 to implement the f and g LLR functions of (2) and (3), as well as the partial sum functions of (4) and (5). While the latter may be implemented using networks of XOR gates 204, the f and g functions may be implemented using networks of fixed-point processing units 2201. In some examples, the inner datapath 1601 may perform the computations 1806 associated with one visit to one sub-row 1704 in one row 1703 of one inner column 1702. Likewise, in some examples, the outer datapath 1602 may perform the computations 1804 associated with one row 1703 in the outer column 1701. Finally, in some examples of the partial sum chain described herein, each instance of the partial sum datapath 1603 may be used to propagate 1805 partial sums through one inner column 1702.

FIG. 12 illustrates an examples schematic of a proposed processing unit that can be reconfigured to perform either the T function of (2) or the ‘g’ function of (3), according to example embodiments of the invention.

1) Processing Unit and Fixed-Point Number Representation:

The proposed processing unit 2201 of FIG. 12 accepts two fixed-point input LLRs {tilde over (x)}_(a) 2202 and {tilde over (x)}_(b) 2203, as well as a bit input û_(a) 2204 and a mode input 2205. Depending on binary value provided by the mode input 2205, the processing unit 2201 combines the other inputs to produce a fixed-point output LLR 2206 {tilde over (x)}_(c)=f({tilde over (x)}_(a), {tilde over (x)}_(b)) or {tilde over (x)}_(d)=g({tilde over (x)}_(a), {tilde over (x)}_(b), û_(a)), according to either (2) or (3), as depicted in FIG. 4.

Some previous implementations of polar codes in the literature [10], [13] have used the two's complement fixed point number representation to represent each LLR {tilde over (x)} as a vector of W bits [{tilde over (x)}_(w)]_(w=1) ^(W), where {tilde over (x)}₁ is both the Most Significant Bit (MSB) and the sign bit, {tilde over (x)}_(W) is the Least Significant Bit (LSB) and {tilde over (x)}=−2^(W−1){tilde over (x)}₁+Σ_(w=2) ^(W)2^(W−w){tilde over (x)}_(w). With this approach, the g function of (3) may be implemented using a single adder. Here, subtraction may be implemented when required by complementing all of the bits in the two's complement fixed-point representation of the LLR being subtracted, then adding it to the other LLR, together with an additional ‘1’ using the carry-in input of the full adder circuit. In the f function of (2), it is necessary to negate {tilde over (x)}_(a) and {tilde over (x)}_(b) if they are negative, in order to determine the absolute values |{tilde over (x)}_(a)| and |{tilde over (x)}_(b)|, respectively.

FIG. 13 illustrates an example of the known art on the two's complement implementation of the ‘f’ function of (2): (a) Naive implementation; (b) A reduced hardware implementation; (c) A reduced critical path implementation.

In a naive implementation of the f function, each of these two negations can be implemented by complementing 2301 all bits in the two's complement fixed-point representation of the LLR and adding 1, using an adder circuit 2302, producing the absolute values shown in FIG. 13a . Following this, min(|{tilde over (x)}_(a)|, |{tilde over (x)}_(b)|) can be implemented by using a third adder 2303 to subtract |{tilde over (x)}_(a)| from |{tilde over (x)}_(b)| and using the sign bit of the result to select 2304 either |{tilde over (x)}_(a)| or |{tilde over (x)}_(b)|, according to the compare and select operations shown in FIG. 13a . Finally, depending on the signs of {tilde over (x)}_(a) and {tilde over (x)}_(b), it may be necessary to negate min(|{tilde over (x)}_(a)|, |{tilde over (x)}_(b)|), requiring a fourth adder 2305. In more sophisticated two's complement implementations, the functionality of the first three adders 2302, 2303 described above may be achieved using only a single adder 2306. This enables the f function to be implemented using two adders in series, where the second adder 2307 performs a negation when necessary, as shown in FIG. 13b . In order to reduce the critical path length to only a single adder, an alternative implementation can implement the f function using three adders 2306, 2308 in parallel, as shown in FIG. 13c . Here, one adder 2306 is used to combine the functionality of the first three adders 2302, 2303 described above and to determine whether f({tilde over (x)}_(a), {tilde over (x)}_(b)) should be given by {tilde over (x)}_(a), −{tilde over (x)}_(a), {tilde over (x)}_(b) or −{tilde over (x)}_(b). Meanwhile, the other two adders 2308 calculate −{tilde over (x)}_(a) and −{tilde over (x)}_(b), in case these values are selected 2309 by the first adder 2306. Some other previous implementations of polar codes in the literature [15], [16], [26], [36] have used the sign-magnitude fixed point number representation to represent each LLR {tilde over (x)} as a vector of W bits [{tilde over (x)}_(w)]_(w=1) ^(W), where {tilde over (x)}₁ is the sign bit, {tilde over (x)}₂ is the MSB, {tilde over (x)}_(W) is the LSB and {tilde over (x)}=(−1)^({tilde over (x)}) ¹ ·(Σ_(w=2) ^(W)2^(W−w){tilde over (x)}_(w)). Meanwhile, some previous implementations [29] have used the one's complement fixed point number representation, where {tilde over (x)}=(−1)^({tilde over (x)}) ¹ ·(Σ_(w=2) ^(W)2^(W−w)XOR({tilde over (x)}_(w), {tilde over (x)}₁)). While these approaches allow the f function of (2) to be completed using a single adder, additional adders are required to convert to and from the two's complement fixed point number representation, in order to perform the g function of (3). Alternatively, these approaches can be implemented using only a single adder to perform both the f and g function, at the cost of sometimes introducing an error of ±1 into the resultant LLRs {tilde over (x)}_(c) and {tilde over (x)}_(d), which degrades the error correction capability of the polar decoder [29].

In contrast to these previous implementations, the input LLRs, output LLR and internal operation of the proposed processing unit 2201 of FIG. 12 employ a fixed-point number representation in which a two's complement number is appended onto an additional sign bit. More specifically, each input LLR ˜x 2202, 2203 is represented as a vector of W+1 bits [{tilde over (x)}_(w)]_(w=0) ^(W),

where {tilde over (x)}₀ is the additional sign bit, {tilde over (x)}₁ serves as both the MSB and the two's complement sign bit, {tilde over (x)}_(W) is the LSB and {tilde over (x)}=(−1)^({tilde over (x)}) ⁰ ·(−2^(W−1){tilde over (x)}₁+Σ_(w=2) ^(W)2^(W−w){tilde over (x)}_(w)). Here, the sign of the LLR may be obtained as sign ({tilde over (x)})=(−1)^(XOR({tilde over (x)}) ₀, {tilde over (x)}₁). In other words, the additional sign bit indicates whether the value represented by the two's complement fixed point number should be negated or not, in order to recover the true LLR value. Note that in alternative arrangements, the W+1 bits of the proposed fixed-point number representation may be reordered, for example by placing the additional sign bit last rather than first in the vector and/or by using an LSB-first rather than MSB-first two's complement representation. Note that while some of the previous efforts referenced above have momentarily used binary flags to indicate that an accompanying two's complement fixed point number requires negation. However, these flags are not passed between processing units or into memory. In particular, none of the processing units of previous efforts have the input circuitry required to accept inputs 2202, 2203 adopting the proposed fixed-point number representation.

The proposed processing unit 2201 employs only a single adder 2207, which may be shared to perform both the g function of (3) and the f function of (2), as characterised by the schematic and truth tables of FIG. 12. The two inputs 2208 to the adder each have W bits, which derive from the two's complement parts of {tilde over (x)}_(a) and {tilde over (x)}_(b), while the output 220 comprises W+1 bits, in order to avoid overflow. Depending on the value of û_(a), as well as the additional sign bits of {tilde over (x)}_(a) and {tilde over (x)}_(b), the two's complement part of the LLR {tilde over (x)}_(d)=g({tilde over (x)}_(a), {tilde over (x)}_(b), û_(a)) may be implemented by using the adder 2207 to either add the two's, complement part of {tilde over (x)}_(a) to that of {tilde over (x)}_(b), or to subtract the two's complement part of {tilde over (x)}_(a) from that of {tilde over (x)}_(b). A high degree of hardware reuse is achieved because the min(|{tilde over (x)}_(a)|, |{tilde over (x)}_(b)|) term of the f function can also be implemented by using the adder 2207 to perform either this addition or this subtraction, depending on the values of both sign bits in both of {tilde over (x)}_(a) and {tilde over (x)}_(b). The MSB of the resulting two's complement number may then be used to select 2210 either the two's complement part of {tilde over (x)}_(a) or {tilde over (x)}_(b) to provide that of the LLR {tilde over (x)}_(c)=f({tilde over (x)}_(a), {tilde over (x)}_(b)). For both the f and g functions, the additional sign bit of the LLRs {tilde over (x)}_(c) and {tilde over (x)}_(d) can be obtained using simple combinational logic, as characterised by the truth tables of FIG. 12. Owing to the additional bit introduced by the adder 2207, the output 2206 of the proposed processing unit 2201 comprises W+2 bits, where the represented LLR {tilde over (x)}_(c) or {tilde over (x)}_(d) is given by {tilde over (x)}=(−1)^({tilde over (x)}0)·(−2^(W){tilde over (x)}₁+Σ_(w=2) ^(W+1)2^(W+1−w){tilde over (x)}_(w)). Note that the proposed approach does not introduce any ±1 errors into the resultant LLRs {tilde over (x)}_(c) or {tilde over (x)}_(d), preserving the same error correction capability as the two's complement fixed-point number representation, but using only a single adder 2207 per processing unit 2201.

Note that in the outer datapath 1602 of Section II-B3, some processing units 2201 are only ever required to perform one or other of the f or g functions. In these cases, the mode input 2205 and all circuitry that is specific to the unused mode can be removed. Note that the two's complement fixed-point numbers that are provided to the LLR input 1607 of the proposed polar decoder kernal 111 can be converted to the proposed fixed-point number representation by appending them onto a zero-valued additional sign bit. Following this, the proposed fixed-point number representation may be used throughout the proposed polar decoder kernal 111, without the need to ever convert to a two's complement or any other fixed-point number representation. Alternatively, the LLR memory 1604 required to store each LLR can be reduced by one bit by using an adder to convert the LLR to a two's complement fixed-point number, before it is written. More specifically, if the additional sign bit is set, the two's complement number can be negated by inverting all of its bits and then using the adder to increment the resultant value. In order to convert back to the proposed fixed-point number representation when reading the LLR from the LLR memory block 1604, the two's complement fixed-point number can be appended onto a zero-valued additional sign bit.

2) Inner Datapath:

The inner datapath 1601 is used to perform all LLR and bit calculations for each visit 1806 to each sub-row 1704 in the inner columns 1702 of the polar code graph 201, 202, 203. In some examples, as described herein, the inner datapath 1601 may be parameterised by s_(i) and n_(i), Here, these parameters are referred to as the number of inner datapath stages and the inner datapath block size, respectively. Note that using a larger value for n_(i) is similar to processing more than one sub-row having a smaller n_(i) at the same time. In this example, the values of these parameters are fixed at design time, where the number of inner datapath stages s_(i) can adopt any value in the range 1 to n_(max)−s_(o), while the inner datapath block size can adopt the value of any power of two in the range 2^(s) ^(i) to N_(max).

FIG. 14 illustrates an example schematic of the inner datapath in the proposed polar decoder kernal, for the example of s_(i)=2 and n_(i)=8, according to example embodiments of the invention. This example of the inner datapath 1601 schematic may be suitable for SC decoding. In the case of SCL decoding, L number of parallel replicas of this schematic may be used, where L is the list size. The inner datapath 1601 has an input v that identifies which visit is being made to the current sub-row 1704, where the visit index is in the range 0 to 2^(s) ^(c) −1. Note that this input is not shown in FIG. 14, for the sake of simplicity. In the case of SC decoding, the inner datapath 1601 takes inputs from n_(i) bits on its left-hand edge 2401. In this example, these input bits originate from the outer datapath 1602 as described herein and previous visits of the inner datapath 1601 to the inner columns 1702 to the left, via successive hops through the partial sum datapaths 1603 and the bit memory blocks 1605. This vector of bit inputs may be decomposed into 2^(s) ^(c) equal-length sub-vectors, corresponding to the 2^(s) ^(c) connected rows 1703 in the column immediately to the left. However, during a particular visit v to the current sub-row 1704, only the first v sub-vectors will contain valid bits, since the processing will only have been completed for the first v connected rows 1703 in the column to the left. Note that since the lowest connected row 1703 in the column to the left will not be visited until after the final visit to the current row 1703 in the current column, the last sub-vector of the input bits will never provide valid bits. Motivated by this, the last n_(i)/2^(s) ^(i) inputs and all connected circuitry may be removed in an alternative arrangement. Furthermore, the inner datapath 1601 takes inputs from n_(i) LLRs on its right-hand edge 2402, which originate from previous visits of the inner datapath 1601 to the column 1702 immediately to the right, via the corresponding LLR memory block 1604. Here, the proposed aforementioned fixed-point number representation may be used for each LLR, as detailed below. The inner datapath 1601 provides outputs for n_(i) bits on its left-hand edge 2403, which are provided to the partial sum datapath 1603 of Section II-B4, via the corresponding bit memory block 1605. Furthermore, in some examples, the inner datapath 1601 provides outputs for n_(i) fixed-point LLRs on its left-hand edge 2404, which are provided to the column 1701, 1702 immediately to the left, via the corresponding LLR memory block 1604. However, only a subset of these outputs carry valid LLRs, as identified by the n_(i) write enable signals that are output on the left-edge of the inner datapath 1601. Note that these write enable signals are not shown in FIG. 14, for the sake of simplicity.

As shown in FIG. 14, the inner datapath 1601 includes a graph 2405 of XORs 204. Here, each input to the left-hand edge of the XOR graph 2405 is taken from the corresponding bit input 2401 on the left-hand edge of the inner datapath 1601, while the corresponding output from the right-hand edge of the XOR graph 2405 is provided to the corresponding bit output 2403, which is also on the left-hand edge of the datapath. Note that the XOR graph 2405 resembles the right-most s_(i) stages 207 in a graph representation of the generator matrix F^(⊗ log) ² ^((n) ^(i) ⁾. However the lowest n_(i)/2^(s) ^(i) XORs 204 in each stage are omitted in the XOR graph 2405 of the inner datapath 1601, since these would connect to the lowest n_(i)/2^(s) ^(i) input bits, which never carry valid bits, as described above. This leads to the omission of some XORs 204 in the rearranged graph of FIG. 11. Note that when the number of stages s_(c) in the current column is lower than s_(i), the number of stages in the XOR graph 2405 is reduced to match s_(c) by disabling the XOR gates 204 in the left-most stages of the graph 2405. This may be achieved by using AND gates 2406 to mask the corresponding vertical connections in the datapath, as shown in FIG. 14.

Furthermore, in some examples, the inner datapath 1601 may include a network 2407 of processing units 2201, each of which may be configured at run time to perform either an f function of (2) or a g function of (3). Each input to the right-hand edge of the processing unit network 2407 is taken from the corresponding LLR input 2402 on the right-hand edge of the inner datapath 1601, while each output from the left-hand edge of the network is provided to the LLR output 2404 on the left-hand edge of the datapath. The network 2407 comprises s_(i) stages, where the right-most stage comprises n_(i)/2 processing units 2201 and each successive stage to the left contains half as many processing units 2201 as the stage to its right.

In some examples, the processing units may be configured to operate on the basis of the fixed point number representation as described herein, where an incremental bit width is used in each successive stage from right to left. However, a clipping circuit (not shown) may be used to reduce the bit width of the soft bits or LLRs output on the left-hand edge of the network of processing units, so that it matches the bit widths of the soft bits or LLRs input on the right-hand edge. In an alternative arrangement, clipping may be additionally performed between some particular stages of the processing unit network, which reduces the inner datapath's hardware resource requirement, at the cost of degrading the polar decoder's error correction capability. The critical path through the processing unit network comprises s_(i) processing units 2201 in series and the total number of processing units 2201 is given by n_(i)(1−2^(−s) ^(i) ), as quantified in FIG. 10 for the case of L=8 list decoding, which implies that L=8 replicas of the inner datapath 1601 are required. The processing units 2201 in the network 2407 are connected together in order to form a binary tree. These connections are arranged in accordance with the top-most XORs 204 in the right-most s_(i) stages 207 from a graph representation 201, 202, 203 of the generator matrix F^(⊗ log) ² ^((n) ^(i) ⁾. Note that this tree structure is similar to those proposed in [26], [30] and [32], albeit those previous implementations do not flexibly support different kernal block lengths N at run-time. Note that when the number of stages s_(c) in the current column is lower than s_(i), the number of stages in the processing unit network 2407 is reduced to match s_(c) by using multiplexers 2408 to bypass the processing units 2201 in the left-most stages of the network 2407, as shown in FIG. 14.

Depending on which visit v is being made to the current sub-row 1704, the processing units 2201 perform either the f function of (2) or the g function of (3). More specifically, the visit index v is converted to a binary number having s_(c) digits, but in reverse order with the LSB mapped to the left-most stage of processing units in the inner datapath and a most significant bit (MSB) mapped to the right-most stage of processing units in the inner datapath. If the bit in a particular position within the reversed binary representation of the visit index has a value ‘0’, then the processing units 2201 in the corresponding stage of the network perform the f function of (2). By contrast, if the corresponding bit is a ‘1’, then these processing units 2201 perform the g function of (3). Here, multiplexers 2409 are used to deliver the correct bit from the XOR graph 2405 to each processing unit 2201 that computes a g function.

As shown in FIG. 14, an arrangement of multiplexers 2408 is used to position the n_(i)/2^(s) ^(c) LLRs generated by the processing unit network among the n_(i) LLR outputs on the left-hand edge 2404 of the inner datapath 1601. Circuitry is also provided to assert the write enable outputs that have the corresponding positions to these LLRs. More specifically, the arrangement of multiplexers 2408 maps the LLR having each index m∈[0, n_(i)/2^(s) ^(c) −1] provided by the processing unit network 2407 to a different one of the n_(i) outputs on the left-hand edge 2404 of the inner datapath 1601 having the index n(m)∈[0, n_(i)−1], according to

${n(m)} = {\left\lfloor \frac{{{mod}\left( {j_{c},r_{c - 1}} \right)}n_{i}}{r_{c - 1}} \right\rfloor + {2^{s_{c}}{m.}}}$

Here, j_(c)∈[0, N−1] is referred to as the first index, which represents the vertical index of the top-most connection of the polar code graph 201, 202, 203 that belongs to the current sub-row 1704 in the current column c, where j_(c)=0 for the top-most sub-row in the top-most row. The first index may be obtained according to: j _(c) =y _(c) r _(c) +s

where y_(c)∈[0, N/r_(c)−1] is the index of the row 1703 currently being visited in the column c, and s∈[0, max(r_(c)/n_(i), 1)−1] is the index of the sub-row 1704 being visited in that row 1703. Among the vector of n_(i) write enable signals that are output on the left-hand edge of the inner datapath 1601, the corresponding sub-set of n_(i)/2^(s) ^(c) signals having the indices n(m) are asserted. In some examples, this operation of the multiplexers 2408 and the write enable signals allows the LLRs output by the inner datapath 1601 to be written directly to the corresponding LLR memory block 1604. In some examples, the controller 1606 may be configured to insert pipelining registers between some or all of the stages in the XOR graph 2405 and the processing unit network 2407.

3) Outer Datapath:

FIG. 15 illustrates an example schematic of an outer datapath for SC decoding in the proposed polar decoder kernal, for the example of s_(o)=2 and n_(i)=4, according to example embodiments of the invention.

In the case of SC decoding, the outer datapath 1602 of FIG. 15 may be used to perform all LLR and bit calculations 1804 for each row 1703 in the outer column 1701 of the polar code graph 201, 202, 203. The outer datapath 1602 is parameterised by s_(o), which is referred to as the number of outer datapath stages. In some examples, the value of this parameter is fixed at design time and may adopt any value in the range 0 to n_(max)=log₂(N_(max)). Here, it is assumed that 2^(s) ^(o) ≤n_(i). In the case where 2^(s) ^(o) ≤n_(i), the larger width of 2^(s) ^(o) would be required for the interface with the corresponding LLR memory block 1604 of FIG. 6, together with modifications to the controller 1606.

The outer datapath 1602 takes inputs from 2^(s) ^(o) redundant bits 2501 and 2^(s) ^(o) redundant bit flags 2502 on its left-hand edge, which originate from the corresponding inputs 1608 of the proposed polar decoder kernal 111. The outer datapath 1602 also takes inputs from n_(i) LLRs on its right-hand edge 2503, which originate from the inner datapath 1601, via the corresponding LLR memory block 1604. Furthermore, the outer datapath 1602 provides outputs for n_(i) bits on its right-hand edge 2504, which are provided to the inner datapath 1601 and the partial sum datapath 1603, via the corresponding bit memory block 1605. Additionally, the outer datapath 1602 provides outputs for 2^(s) ^(o) bits on its left-hand edge 2505, which contribute to the recovered kernal information block û 114. In the case of SC decoding, these bits may be written directly to the bit output 1609 of the proposed polar decoder kernal 111, which therefore adopts a width of n_(b)=2^(s) ^(o) .

The outer datapath 1602 operates on the basis of a graph representation 201, 202, 203 of the generator matrix F^(⊗s) ^(o) , which it uses to perform all XOR, f and g operations, according to the previously described data dependencies. Accordingly, the outer datapath 1602 includes an XOR graph, comprising s_(o) stages, each comprising 2^(s) ^(o) ⁻¹ XORs 204. Furthermore, the outer datapath 1602 includes an f/g graph, which also comprises s_(o) stages, each having 2^(s) ^(o) ⁻¹ processing units 2201 that perform only the f function and 2^(s) ^(o) ⁻¹ processing units 2201 that perform only the g function, as described herein.

The processing units 2201 operate on the basis of the fixed point number representation, where an incremental bit width is used in each successive processing unit 2201 along the critical path shown in FIG. 15.

The input on the right-hand edge 2503 of the f/g graph comprises 2^(s) ^(o) fixed-point LLRs, as shown in FIG. 15. An arrangement of multiplexers 2506 is used to select these 2^(s) ^(o) LLRs from among the n_(i) LLR provided by the input on the right-hand edge 2503 of the outer datapath 1602. More specifically, the arrangement of multiplexers 2506 selects the LLR having each index m∈[0, min(2^(s) ^(o) , N)−1] on the input of the f/g graph from a different one of the n_(i) inputs on the right-hand edge 2503 of the inner datapath 1601 having the index n(m)∈[0, n_(i)−1], according to n(m)=mn_(i)/r₁.

Note that if N<2^(s) ^(o) , then the LLRs having each index m∈[N, 2^(s) ^(o) −1] on the input of the f/g graph are set to the greatest positive value supported by the fixed-point number representation. These additional LLRs have no influence upon the decoding process, since they correspond to the asserted frozen bit flags that are appended to the frozen bit vector in the case where N<2^(s) ^(o) .

The outer datapath 1602 also includes circuits 2507 for selecting the value of the bits that are output on the left-hand edge 2505 of the outer datapath. More specifically, if the corresponding redundant bit flag is set 2502, then the value of the corresponding redundant bit 2501 is adopted. If not, then the sign of the corresponding LLR is used to select a value for the bit, where a positive LLR gives a bit value of 0, while a negative LLR gives a bit value of 1. These decisions inform the XOR and g operations performed within the graph and also drive the bit output on the left-hand edge 2505 of the outer datapath 1602.

Following the completion of all XOR operations 204 within the outer datapath 1602, a vector of 2^(s) ^(o) bits are produced on the right-hand edge of the XOR graph, as shown in FIG. 15. An arrangement of multiplexers 2508 is used to position these 2^(s) ^(o) bits among the bit outputs on the right-hand edge 2504 of the outer datapath 1602. More specifically, the arrangement of multiplexers 2508 maps the bit having each index m∈[0, min(2^(s) ^(o) , N)−1] on the output of the XOR graph to a different one of the n_(i) output on the right-hand edge 2504 of the inner datapath 1601 having the index n(m)∈[0, n_(i)−1], according to n(m)=mn_(i)/r₁; while zero-valued bits are provided to all other outputs on the right-hand edge 2504 of the outer datapath 1602. In some examples, the controller 1606 may be configured to insert pipelining registers between some or all of the stages in the XOR graph and the f/g graph.

In the case of SCL decoding, the outer datapath 1602 must be additionally capable of performing all partial sum, f and g computations for all candidates in the list. Furthermore, the outer datapath 1602 must compute the metrics of (7), which accumulate over successive kernal information bits. Here, registers may be used to pass metrics between successive visits to successive rows 1703 in the outer column 1701. Additionally, in some examples, the outer datapath 1602 requires a sorting circuit, in order to identify and select the L candidates having the lowest metrics. Finally, a bit memory block having a capacity of LN_(max) bits is required to store the L candidate kernal information blocks. Here, additional pointer memories [18] may be used to assist the addressing of this bit memory block. FIG. 10 quantifies the total number of adders required to implement the f, g, metric and sort computations for the case of L=8 SCL decoding.

4) Partial Sum Datapath:

The partial sum datapath 1603 is used to perform the XOR operations 2101 for each sub-row that were omitted from the XOR graph in the inner datapath 1601 and to propagate 1805 bits from left to right in the polar code graph 201, 202, 203. The partial sum datapath 1603 is parameterised by s_(i) and n_(i), which are referred to as the number of inner datapath stages and the inner datapath block size, respectively. Note that using a larger value for n_(i) is similar to processing more than one sub-row having a smaller n_(i) at the same time. As described, in some examples, the values of these parameters are fixed at design time, where the number of inner datapath stages s_(i) can adopt any value in the range 1 to n_(max)−s_(o), while the inner datapath block size can adopt the value of any power of two in the range to 2^(s) ^(i) to N_(max).

In this example, the operation of the partial sum datapath 1603 schematic shown in FIG. 14, is used for SC decoding. In the case of SCL decoding, L number of parallel replicas of this schematic may be used, where L is the list size. In the case of SC decoding, the partial sum datapath 1603 takes inputs from n_(i) bits on its left-hand edge 2601, which originate from the right-hand edge 2504 of the outer datapath 1602 and the left-hand edge 2403 of the inner datapath 1601, via successive hops through other replicas of the partial sum datapath 1603 and via the bit memory blocks 1605. The partial sum datapath 1603 outputs n_(i) bits on its right-hand edge 2602, which are provided to the left-hand edge 2401 of the inner datapath 1601, via successive hops through other replicas of the partial sum datapath 1603 and via the bit memory blocks 1605.

FIG. 16 illustrates an example schematic of a partial sum datapath in the proposed polar decoder kernal, for the example of s_(i)=2 and n_(i)8, according to example embodiments of the invention.

As shown in FIG. 16, the bottom-most n_(i)/2^(s) ^(i) output bits are set equal to the corresponding input bits. However, the top-most n_(i)−n_(i)/2^(s) ^(i) output bits are obtained as an XOR 204 of the corresponding input bit and one of the bottom-most n_(i)/2^(s) ^(i) input bits. Here, the particular bit is identified such that both bits in each XORed pair have the same index modulo n_(i)/2^(s) ^(i) , where each bit index will be in the range ‘0’ to n_(i)−1 before the modulo operation and ‘0’ to n_(i)/2^(s) ^(i) −1 after the modulo operation. Since the partial sum datapath 1603 is invoked at the interface between each consecutive pair of inner columns 1702, the XORs 204 of the partial sum datapath 1603 correspond to the additional XORs 2101 that were introduced in the rearranged graph of FIG. 11.

Note that in an alternative arrangement, the results of the XORs 204 performed by the inner datapath 1601 may be discarded after they are used as inputs to the g functions, rather than output on the left-edge 2403 of the inner datapath 1601 and stored in the bit memories 1605. In this case, the partial sum datapath 1603 must be relied upon to perform all XOR operations 204 for the corresponding sub-row during the propagation 1805 of the partial sums. This may be achieved by replacing the n_(i)−n_(i)/2^(s) ^(i) XORs 2101 of FIG. 16 with a complete XOR graph, which resembles the right-most stages 207 in a graph representation 201, 202, 203 of the generator matrix F^(⊗ log) ² ^((n) ^(i) ⁾. However, this approach would require s_(i)n_(i)/2 XORs 204, which is typically a higher number than the n_(i)−n_(i)2^(s) ^(i) XORs 204 employed by the proposed approach. Furthermore, the critical path would comprise s_(i) XORs 204, as compared with the single XOR 204 of the proposed approach

Memory

The proposed polar decoder kernal 111 employs two types of memory, namely the LLR memory blocks 1604 and the bit memory blocks 1605.

1) LLR Memory:

As shown in FIG. 17, the proposed polar decoder kernal 111 employs C_(max) two-dimensional blocks of LLR memory 1604, namely LLR Memory 1 to LLR Memory C_(max). Conceptually, LLR Memory c∈[1, C_(max)−1] may be considered to be situated at the interface on the left-hand edge of the inner column 1702 with the index c∈[1, C_(max)−1], while LLR Memory C_(max) may be considered to reside at the interface between the right-most column 1702 and the LLR input 1607 of the proposed polar decoder kernal 111. The memory block with the index c comprises a single Random Access Memory (RAM), having a width of n_(i) fixed-point LLRs and a depth of max(r_(c−1, max)/n_(i), 1) addresses, where the width and depth represent the two dimensions of the memory block. The total LLR memory requirement of the proposed polar decoder kernel 111 is given by Σ_(c=1) ^(C) ^(max) max(r_(c−1,max), n_(i)) LLRs. Note that rather than accommodating the C_(max) memory blocks in a third RAM dimension using C_(max) distinct RAMs, alternative arrangements may accommodate the C_(max) blocks of memory within a single RAM, by extending its depth to accommodate all of the memory blocks in the depth dimension instead. However, this alternative arrangements would imply different datapath interfaces and controller 1606 designs to those described below and elsewhere in the description. In some examples, it is assumed that n_(i)≥2^(s) ^(o) . In the case where n_(i)/2^(s) ^(o) , the larger width of 2^(s) ^(o) would be required for LLR Memory 1 and LLR Memory C_(max), together with modifications to the controller 1606, in order to support the interface with the outer datapath 1602.

Note that in the case of SCL decoding, the LLR memory blocks 1604 having the indices ‘1’ to C_(max)−1 must be replicated L times, which may be accommodated in the RAM dimension or in the width dimension. Here, an additional pointer memory [18] may be used to assist the addressing between these replicas of the memory. However, only a single replica of the LLR memory block 1604 having the index C_(max) is required, since the LLRs provided by LLR input 1607 of the polar decoder kernal 111 are common to all L decoding attempts. The total capacity of the LLRs memory blocks is quantified for the case of L=8 SCL decoding in FIG. 10, excluding the pointer memory. As a result of these considerations, the LLRs provided to the LLR input 1607 of the proposed polar decoder kernal 111 are always stored in the LLR memory block 1604 having the index C_(max), irrespective of how many columns C are used to decode the current kernal block length N. As an additional benefit, the LLR memory block 1604 having the index C_(max) may be interfaced with the LLR input 1607 of the proposed polar decoder kernal 111 using a width n₁ that is decoupled from that of the inner datapath n_(i). In this way, LLRs may be loaded into the proposed polar decoder quickly, using a large value for n_(i), irrespective of how the inner datapath 1601 is parameterised.

For the sake of simplicity however, in this example let us assume that n₁=n_(i). In the case where the number N of input LLRs is less than the width n_(i) of LLR Memory C_(max), an equal number of zero-valued LLRs are inserted after each input LLR, before they are provided to the input to the memory, in order to occupy its full width. Note that in the case where the LLR input 1607 of the proposed polar decoder kernal 111 adopts the two's complement fixed-point number representation, the LLR memory block 1604 having the index C_(max) can store the supplied two's complement LLRs directly, without the additional sign bit introduced by the proposed fixed-point number representation of some examples.

FIG. 17 illustrates an example schematic of the interaction between the inner datapath, LLR memory blocks and controller of the proposed polar decoder kernal, according to example embodiments of the invention.

A single LLR memory block 1604 is exemplified in FIG. 17, for the case of s_(i)=1 and n_(i)=4. As shown in FIG. 17, the RAM of each LLR memory block 1604 has an n_(i)-LLR read data port 2701 which outputs the LLRs across the width of a particular one of the max(r_(c−1,max)/n_(i), 1) addresses across the depth of the RAM, where the particular address is selected by an input provided on an address port 2702, as shown in FIG. 17. Likewise, the RAM has a n_(i)-LLR write port 2703, as shown in FIG. 17. This write port 2703 accepts inputs that can update the n_(i) LLRs across the width of a particular address, which is selected by the input provided on the address port 2704. However, these n_(i) LLRs are only updated if corresponding write enable signals 1615 are asserted. It is assumed that n_(i) individual write enable signals 1615 can be used to control whether each of the n_(i) LLRs is written individually. If this is not supported natively by a particular hardware RAM implementation, then the write port can be driven by n_(i) multiplexers 1614, which can be used to multiplex the input LLRs with feedback from the read port 2701, as shown in FIG. 17. In this way, the n_(i) write enable signals 1615 can individually control the LLRs selected by these n_(i) multiplexers, either writing the new LLR value to the RAM, or maintaining the current LLR value by writing the corresponding LLR obtained from the read port 2701.

As shown in FIG. 17, each operation of the inner datapath 1601 within the column c reads from the LLR memory block 1604 having the index c+1 and writes into the LLR memory block 1604 having the index c, using corresponding write enable signals 1615. Likewise, each operation of the outer datapath 1602 reads from the LLR memory block 1604 having the index c=1 if C>1 or from the LLR memory block 1604 having the index C_(max) otherwise. These interfaces between the LLR memory blocks 1604 and the various datapaths 1601, 1602 are designed specifically to avoid the requirement for complicated routing networks, which would be required to allow any LLR in the memory blocks to be read or written by any of the inputs or outputs of the datapaths 1601, 1602. Instead, the arrangement of the LLRs in the memory block is designed such that only simple routing networks are required between the LLR memory blocks 1604 and the datapaths 1601, 1602. Likewise, in some examples, it is designed so that only a limited number of control signals are required from the controller 1606. More specifically, during each step of the decoding process, the n_(i) LLRs across the width of a particular address within the appropriate memory block are read and delivered seamlessly to the inner datapath 1601 or outer datapath 1602, as appropriate. Likewise, a subset of the n_(i) LLRs across the width of a particular address within the appropriate memory block are written using LLRs and write enable signals 1615 that are delivered seamlessly by the inner datapath 1601, whenever it is operated. The controller 1606 only has to provide appropriate read and write addresses 2702, 2704 to the two memory blocks 1604.

2) Bit Memory:

As shown in FIG. 6, the proposed polar decoder kernal 111 employs C_(max)−1 three-dimensional blocks of bit memory 1605, namely Bit Memory 1 to Bit Memory C_(max)−1. Conceptually, Bit Memory c may be considered to be situated on the left-hand edge of the column 1702 having the corresponding index c, at the interface with the column 1701, 1702 having the index c−1. Here, the bit memory block 1605 with the index c comprises 2^(s) ^(i) RAMs, having widths of bits and depths of max(2^(s) ^(o) ^(+(c−1)s) ^(i) /n_(i), 1) addresses, where the RAMs, width and depth represent the three dimensions of the memory block 1605. The total bit memory requirement of the proposed polar decoder kernal 111 is given by Σ_(c=1) ^(C) ^(max) ⁻¹ max(2^(s) ^(o) ^(+(cs) ^(i) , 2^(s) ^(i) n_(i)) bits.

Note that in the case of SCL decoding, the bit memory blocks 1605 must be replicated L times, which may be accommodated in the RAM dimension or in the width dimension. Here, additional pointer memories [18] may be used to assist the addressing between these replicas of the memory. The total capacity of the bit memory blocks 1605 is quantified for the case of L=8 SCL decoding in FIG. 10, including the output bit memories described in some examples, but excluding the pointer memories. Note that an alternative arrangement may swap the roles of the RAM and width dimensions, instead employing n_(i) RAMs, having widths of 2^(s) ^(i) bits, although this would imply different datapath interfaces and controller 1606 designs to those described below and in other examples. As mentioned, in some examples, it is assumed that n_(i)≥2^(s) ^(o) . In the case where n₁<2^(s) ^(o) , the larger width of 2^(s) ^(o) would be required for bit Memory 1, together with modifications to the controller 1606, in order to support the interface with the outer datapath 1602.

FIG. 18 illustrates an example schematic of the interaction between the inner datapath, bit memory blocks and controller of the proposed polar decoder kernal, for the case where s_(i)=1 and n_(i)=4, according to example embodiments of the invention.

A single bit memory block 1605 is exemplified in FIG. 18, for the case of s_(i)=1 and n_(i)=4. As shown in FIG. 18, each RAM in each block of bit memory 1605 has an n_(i)-bit read port 2801. This read port 2801 outputs the n_(i) bits across the width of a particular one of the max(2^(s) ^(o) ^(+(c−1)s) ^(i) /n_(i), 1) addresses across the depth of the RAM. Here, the particular address is selected by an input provided on an address port 2802, as shown in FIG. 18. Likewise, each RAM has an n_(i)-bit write port 2803, as shown in FIG. 18. This write port 2803 accepts inputs that can update the n_(i) bits across the width of the particular address, which is selected by the input provided on the address port 2804. However, these n_(i) bits are only updated if corresponding write enable signals 1616 are asserted. It is assumed that n_(i) individual write enable signals 1616 can be used to control whether each of the n_(i) bits is written individually. If this is not supported natively by a particular hardware

RAM implementation, then the write port 2404 can be driven by n_(i) multiplexers 1617, which can be used to multiplex the input bits with feedback from the read port 2801. For the sake of simplicity, this mechanism is not shown in FIG. 18, although it is shown in FIG. 6. In this way, the n_(i) write enable signals 1616 can individually control the bits selected by these n_(i) multiplexers 1617, either writing the new bit value to the RAM, or maintaining the current bit value by writing the corresponding bit obtained from the read port 2801.

As shown in FIG. 6, the outer datapath 1602, the C−2 instances of the partial sum datapath 1603 and the C−1 instances of the bit memory block 1605 form a chain. More specifically, Bit Memory 1 resides between the outer datapath 1602 and Partial Sum Datapath 1, while Bit Memory c∈[2, C−2] resides between Partial Sum Datapath c−1 and Partial Sum Datapath c, while Bit Memory C−1 terminates the chain and resides to the right of Partial Sum Datapath C−2. In a step of the decoding process where a sub-row 1704 in the inner column c is being visited, the multiplexers 1612 connected to the bit inputs and outputs on the left-hand edge of the inner datapath 1601 are controlled such that it is interfaced with Bit Memory c. Here, FIG. 18 details the interface between Bit Memory c and its neighbouring datapaths 1601, 1602, 1603.

These interfaces between the bit memory blocks 1605 and the various datapaths 1601, 1602, 1603 are designed specifically to avoid the requirement for complicated routing networks, which would be required to allow any bit in the memory blocks 1605 to be read or written by any of the inputs or outputs of the datapaths 1601, 1602, 1603. Instead, the arrangement of the bits in the memory block 1605 is designed such that only simple routing networks are required between the bit memory blocks 1605 and the datapaths 1601, 1602, 1603. Likewise, in this example, it is designed so that only a limited number of control signals are required from the controller 1606. More specifically, the address ports of the 2^(s) ^(i) RAMs within a particular bit memory block 1605 are all tied together, only requiring the controller 1606 to generate a single address 2802, 2804 for each of the bit memory blocks 1605. Furthermore, the bit input 2601 on the left-hand edge of Partial Sum Datapath c and the bit input 2401 on the left-hand edge of the inner datapath 1601 both read from Bit Memory c on a simple width-wise basis, as detailed below. Similarly, the bit output 2403 on the left-hand edge of the inner datapath 1601 writes to Bit Memory c on a width-wise basis. By contrast, the bit output 2602 on the right-hand edge of Partial Sum Datapath c−1 writes to Bit Memory c on a simple RAM-wise basis, as detailed below. Likewise, the bit output 2504 on the right-hand edge of the outer datapath 1602 writes to Bit Memory 1 on a RAM-wise basis. In some alternative examples, the width-wise bit memory accesses may be replaced with RAM-wise accesses and vice-versa, although this would imply different datapath interfaces and controller 1606 designs to those described below and elsewhere.

For both width-wise and RAM-wise interfaces between a bit memory block 1605 and a datapath, the bit having the position l∈[0, n_(i)−1] in the input or output of the datapath is read from or written to a particular position within the width of a particular address within the depth of a particular one of the RAMs in the memory block 1605. This location in the memory block 1605 may be identified by the width coordinate the depth coordinate w_(l)∈[0, n_(i)−1], the depth coordinate d_(l)∈[0, max(2^(s) ^(o) ^(+(c−1)s) ^(i) /n₁, 1)−1] and the RAM coordinate r_(l)∈[0, 2^(s) ^(i) −1]. As mentioned above, the arrangement of the bits in each memory block 1605 and the operation of the proposed polar decoder kernal 111 is such that the address ports 2802, 2804 of the 2^(s) ^(i) RAMs within a particular bit memory block 1605 can all be tied together. This implies that for both width-wise and RAM-wise interfaces, all n_(i) of the bits that are accessed together will all have the same depth coordinate, which is to say that d_(l) has the same value for all l∈[0, n_(i)−1].

Furthermore, the bit in a width-wise datapath interface having the position l∈[0, n_(i)−1] only ever accesses locations in the bit memory block 1605 having the corresponding width coordinate w_(l)=I. However, this bit in the datapath interface may need to access any of the possible RAM coordinates r_(l)∈[0, 2^(s) ^(i) −1] at different times during the polar decoding process. Owing to this, a 2^(s) ^(i) :1 multiplexer 2805 is the only circuitry required to provide the I^(th) bit to a width-wise datapath input.

More specifically, this multiplexer 2805 selects between the bits provided by the l^(th) position in the read ports 2801 of each of the 2^(s) ^(i) RAMs, as shown in FIG. 18. Here, the controller 1606 in some examples is required to provide n_(i) RAM read coordinates to the bit memory block 1605, which may be decoded in order to provide separate control signals to each of these n_(i) multiplexers 2805. By contrast, no additional circuitry is required for the l^(th) bit of a width-wise datapath output, since this bit can be provided to the l^(th) position in the write ports of each of the 2^(s) ^(i) RAMs and the write enable signals 1616 can be used to control which of these RAMs is updated. Here, the controller 1606 in some examples is required to provide n_(i) RAM write coordinates to the bit memory block 1605, which may be decoded in order to n_(i) assert of the write enable signals 1616.

Furthermore, the bit having the position l∈[0, n_(i)−1] in a RAM-wise output of a datapath is only ever written to locations in the memory block 1605 having the corresponding RAM coordinate r_(i)=mod(l, 2^(s) ^(i) ). However, this bit may need to be written to any of the possible width coordinates w_(l)∈[0, n_(i)−1] at different times during the polar decoding process. Owing to this, n_(i)/2^(s) ^(i) :1 a multiplexer 2806 is the only circuitry required to provide each of the inputs to each of the RAMs' 2^(s) ^(i) write ports 2803, as shown in FIG. 18. This is because each input of the RAM having the RAM coordinate n is only selected from the sub-set of datapath outputs having positions l∈[0, n_(i)−1] that satisfy mod(l, 2^(s) ^(i) )=r_(l). Here, the controller 1606 may be required to provide n_(i) width write coordinates to the memory block 1605, which may be decoded to assert n_(i) of the write enable signals 1616, as well as to provide control signals for the corresponding sub-set of n_(i) multiplexers 2806.

As described above, in a step of the decoding process where a sub-row 1704 in the inner column c is being visited, a particular selection of bits are read width-wise from each bit memory block 1605 having an index c′∈[1, c−1], passed though the partial sum datapath 1603 having the index c′ and written RAM-wise into the bit memory block 1605 having the index c′+1. Note that a sub-set of the locations in the Bit Memory c′ that are written RAM-wise by Partial Sum Datapath c′−1 will also be read width-wise by Partial Sum Datapath c′. Motivated by this, the bit memories with indices in the range 2 to c′−1 are operated in transparent mode, so that these bit values provided by the write operation become available to the read operation in the same step of the decoding process. More specifically, as a complement to the feedback from the read port of each RAM in Bit Memory c′ to its write port 1617, a bypass 1610 is provided so that the bits provided to the write port 2803 by Partial Sum Datapath c′−1 can be fed directly to the read port 2801. As shown in FIG. 18, multiplexers 1610 are provided to select between the outputs provided by the read ports 2801 of Bit Memory c′ and the inputs provided by Partial Sum Datapath c′−1. These multiplexers may be driven by the same write enable signals 1616 that control the operation of the corresponding write ports. This allows bits to propagate 1805 from Bit Memory 1, through the chain of partial sum datapaths 1603 and bit memory blocks 1605 described herein, and be delivered to the bit input 2401 on the left edge of the inner datapath 1601. Here, the controller 1606 provides control signals to the bit memory blocks 1605 to ensure that the correct bits are XORed 2101 together in the partial sum datapaths 1603. Following the completion of the inner datapath 1601 operation, the bits provided by the bit output 2403 on its left-hand edge are written to the bit memory block 1605 having the index c. Here, multiplexers 1613 are provided at the input to the write ports 2803, to select between the outputs provided by Partial Sum Datapath c′−1 and the inner datapath 1601. Note that these multiplexers 1613 are located after the point where the transparent bypass 1610 is taken from, in order to prevent the creation of an endless feedback loop.

Controller

As described previously, the proposed polar decoding process comprises a total of N/r₀+Σ_(c=1) ^(C−1)2^(s) ^(c) N/min(r_(c), n_(i)) steps. During each step where a sub-row 1704 in an inner column 1702 having the index c is processed 1806, the controller 1606 is required to provide read control signals to the bit memory blocks 1605 having indices 1 to c. Additionally, the controller 1606 is required to provide read control signals to LLR Memory c+1 when processing 1806 a sub-row 1704 in an inner column 1702 having the index c∈[1, C−2] or to LLR Memory C_(max) when processing 1806 a sub-row 1704 in inner column C−1. Furthermore, the controller 1606 is required to provide write control signals to the bit memory blocks 1605 having indices 2 to c, as well as to the LLR memory block 1604 having the index c, when processing 1806 a sub-row 1704 in an inner column 1702 having the index c. During each step where a row 1703 in the outer column 1701 having the index c=0 is processed 1804, the controller 1606 is required to provide write control signals to Bit Memory 1, as well as to provide read control signals to LLR Memory 1 if C>1 or to LLR Memory C_(max) if C=1. The controller 1606 is designed such that each memory write operation seamlessly arranges the corresponding bits or LLRs in the memory, so that they can be seamlessly read subsequently, without requiring complex interconnection networks.

In addition to the various signals used in the flowchart of FIG. 8, the controller 1606 operation depends on a signal referred to as the first index j_(c)∈[0, N−1]. This represents the vertical index of the top-most connection of the polar code graph 201, 202, 203 that belongs to the sub-row 1704 currently being visited in the column c, where j_(c)=0 for the top-most sub-row 1704 in the top-most row 1703. The first index may be obtained according to j_(c)=y_(c)r_(c)+s₁;

where y_(c)∈[0, N/r_(c)−1] is the index of the row 1703 currently being visited in the column c, and s∈[0, max(r_(c)/n₁, 1)−1] is the index of the sub-row 1704 being visited in that row 1703. During the process of propagating 1805 partial sum bits through successive bit memory blocks 1605 and replicas of the partial sum datapath 1603, the first index associated with each of the columns c′∈[1, c−1] is obtained according to:

${j_{c^{\prime}} = {{\left\lfloor \frac{j_{c}}{r_{c}} \right\rfloor r_{c}} + {vr}_{c - 1} - r_{c^{\prime}} + {{mod}\left( {j_{c},{\max\left( {\frac{r_{c^{\prime}}}{n_{i}},1} \right)}} \right)}}},$

where v∈[0, 2^(s) ^(o) −1] is the index of the visit to the current row 1703 in the current column c.

As described previously in some examples, read and write accesses to the LLR memory blocks 1604 may both be performed width-wise. The position l∈[0, n_(i)−1] in the input or output of LLR Memory c accesses the LLR stored at particular depth and width coordinates,

where

w_(l)=l in all cases.

As described herein in some examples, it is assumed that a circuit is provided to load 1802 LLRs from the corresponding input 1607 of the proposed polar decoder kernal 111, into LLR Memory C_(max). The controller 1606 is required to operate this loading circuit such that when the inner datapath 1601 performs processing 1806 for a particular sub-row 1704 in column C−1, it can read the corresponding LLRs from LLR Memory C_(max) using the depth coordinate:

$d_{l} = {{{mod}\left( {j_{C - 1},{\max\left( {\frac{r_{C - 1}}{n_{i}},1} \right)}} \right)}.}$

Furthermore, when the inner datapath 1601 or outer datapath 1602 performs processing 1804, 1806 for a particular sub-row 1704 in column c∈[0, C−2], it reads from LLR Memory c+1 using the depth coordinate:

$d_{l} = {{{mod}\left( {j_{c},{\max\left( {\frac{r_{c}}{n_{i}},1} \right)}} \right)}.}$

By contrast, when the inner datapath 1601 performs processing 1806 for a particular sub-row 1704 in column c, it writes to LLR Memory c using the depth coordinate:

$d_{l} = {{{mod}\left( {j_{c},{\max\left( {\frac{r_{c - 1}}{n_{i}},1} \right)}} \right)}.}$

Here, it may be observed that the width coordinates w_(l)=l are independent of the first index j_(c) and may therefore be hardwired according to the width-wide operation described in some examples. By contrast, the depth d_(l) coordinate must be controlled by the controller 1606, as a function of the first index j_(c). Note however that the depth coordinates d_(l) are independent of the bit index I, only requiring the controller 1606 to provide a single address 2702, 2704 to the memory block 1604. Note that the LLR provided in position l∈[0, n_(i)−1] of the write port is only written to the LLR memory block 1604 if the write enable signal 1615 in the corresponding position l∈[0, n_(i)−1] is asserted, as described in some examples.

As described in some examples, read and write accesses to the bit memory blocks 1605 made by the inner datapath 1601 are both performed width-wise. For these width-wise memory accesses, the position l∈[0, n_(i)−1] in the input or output of Bit Memory c accesses the bit stored at particular depth d_(l), RAM r_(l) and width w_(l) coordinates, according to:

${d_{l} = {{mod}\left( {j_{c},{\max\left( {\frac{2^{s_{o} + {{({c - 1})}s_{i}}}}{n_{i}},1} \right)}} \right)}},{r_{l} = {{mod}\left( {\left\lfloor \frac{\left( {j_{c} + \left\lfloor \frac{{lr}_{c}}{n_{i}} \right\rfloor} \right)n_{i}}{r_{c - 1}} \right\rfloor,2^{s_{i}}} \right)}}$ w_(l) = l.

Here, it may be observed that the width coordinates w_(l)=l are independent of the first index j_(c) and may therefore be hardwired according to the width-wide operation described in some examples. By contrast, the depth d_(l) and RAM r_(l) coordinates must be controlled by the controller 1606, as a function of the first index j_(c). Note however that the depth coordinates d_(l) are independent of the bit index I, only requiring the controller 1606 to provide a single address 2802, 2804 to the memory block. Note that in some cases where n_(i)>r_(c), the approach described above may result in two or more of the input bits attempting to write to the same location in the bit memory block 1605. In this case, the bit having the lowest index I should be written to the memory and the other contending bits may be safely discarded.

As described in some examples, write accesses to the bit memory blocks 1605 made by the outer datapath 1602 and the partial sum datapath 1603 are performed RAM-wise. For these RAM-wise memory accesses, the position l∈[0, n_(i)−1] in the input of Bit Memory c+1 accesses the bit stored at particular depth d_(l), RAM r_(l) and width w_(l) coordinates, according to:

${d_{l} = {{mod}\left( {j_{c},{\max\left( {\frac{2^{s_{o} + {cs}_{i}}}{n_{i}},1} \right)}} \right)}},{r_{l} = {{mod}\left( {l,2^{s_{i}}} \right)}}$ $w_{l} = {{mod}\left( {\left\lfloor \frac{\left( {j_{c} + \left\lfloor \frac{{lr}_{c}}{n_{i}} \right\rfloor} \right)n_{i}}{r_{c - 1}} \right\rfloor,n_{i}} \right)}$

Here, it may be observed that the RAM coordinates r_(i)=mod(l, 2^(s) ^(i) ) are independent of the first index j_(c) and may therefore be hardwired according to the RAM-wide operation described in some examples. By contrast, the depth d_(i) and width w_(l) coordinates must be controlled by the controller 1606, as a function of the first index j_(c). Note however that the depth coordinates d_(l) are independent of the bit index I, only requiring the controller 1606 to provide a single address 2802, 2804 to the memory block. The above-described method of controlling memory read and write operations results in a characteristic arrangement of the LLRs and bits within the memory blocks 1604, 1605.

FIGS. 19 to 23 provide various examples of this characteristic arrangement, following the completion of the decoding process. Each FIG. illustrates the index j∈[0, N−1] of the connection between two adjacent columns 1701, 1702 in the polar graph 201, 202, 203 that provides the LLR or bit stored at each RAM, depth and width coordinate in the corresponding memory block 1604, 1605.

FIG. 19 illustrates an example of the contents of the LLR following a completion of the decoding process, for the case where N=128, N_(max)=128, s_(o)=1, s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 20 illustrates an example an example of the contents of the LLR and bit memories following a completion of the decoding process, for the case where N=64, N_(max)=128, s_(o)=1, s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 21 illustrates an example of the contents of the LLR and bit memories following a completion of the decoding process, for the case where N=32, N_(max)=128, s_(o)1, s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 22 illustrates an example of the contents of the LLR and bit memories following the completion of the decoding process, for the case where N=16, N_(max)=128, s_(o)=1, s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

FIG. 23 illustrates an example of the contents of the LLR and bit memories following a completion of the decoding process, for the case where N=8, N_(max)=128, s_(o)=1, s_(i)=2 and n_(i)=8, according to example embodiments of the invention.

Referring now to FIG. 24, there is illustrated a typical computing system 2400 that may be employed to implement polar encoding according to some example embodiments of the invention. Computing systems of this type may be used in wireless communication units. Those skilled in the relevant art will also recognize how to implement the invention using other computer systems or architectures. Computing system 2400 may represent, for example, a desktop, laptop or notebook computer, hand-held computing device (PDA, cell phone, palmtop, etc.), mainframe, server, client, or any other type of special or general purpose computing device as may be desirable or appropriate for a given application or environment. Computing system 2400 can include one or more processors, such as a processor 2404. Processor 2404 can be implemented using a general or special-purpose processing engine such as, for example, a microprocessor, microcontroller or other control logic. In this example, processor 2404 is connected to a bus 2402 or other communications medium. In some examples, computing system 2400 may be a non-transitory tangible computer program product comprising executable code stored therein for implementing polar encoding.

Computing system 2400 can also include a main memory 2408, such as random access memory (RAM) or other dynamic memory, for storing information and instructions to be executed by processor 2404. Main memory 2408 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 2404. Computing system 2400 may likewise include a read only memory (ROM) or other static storage device coupled to bus 2402 for storing static information and instructions for processor 2404.

The computing system 2400 may also include information storage system 2410, which may include, for example, a media drive 2412 and a removable storage interface 2420. The media drive 2412 may include a drive or other mechanism to support fixed or removable storage media, such as a hard disk drive, a floppy disk drive, a magnetic tape drive, an optical disk drive, a compact disc (CD) or digital video drive (DVD) read or write drive (R or RW), or other removable or fixed media drive. Storage media 2418 may include, for example, a hard disk, floppy disk, magnetic tape, optical disk, CD or DVD, or other fixed or removable medium that is read by and written to by media drive 2412. As these examples illustrate, the storage media 2418 may include a computer-readable storage medium having particular computer software or data stored therein.

In alternative embodiments, information storage system 2410 may include other similar components for allowing computer programs or other instructions or data to be loaded into computing system 2400. Such components may include, for example, a removable storage unit 2422 and an interface 2420, such as a program cartridge and cartridge interface, a removable memory (for example, a flash memory or other removable memory module) and memory slot, and other removable storage units 2422 and interfaces 2420 that allow software and data to be transferred from the removable storage unit 2418 to computing system 2400.

Computing system 2400 can also include a communications interface 2424. Communications interface 2424 can be used to allow software and data to be transferred between computing system 2400 and external devices. Examples of communications interface 2424 can include a modem, a network interface (such as an Ethernet or other NIC card), a communications port (such as for example, a universal serial bus (USB) port), a PCMCIA slot and card, etc. Software and data transferred via communications interface 2424 are in the form of signals which can be electronic, electromagnetic, and optical or other signals capable of being received by communications interface 2424. These signals are provided to communications interface 2424 via a channel 2428. This channel 2428 may carry signals and may be implemented using a wireless medium, wire or cable, fibre optics, or other communications medium. Some examples of a channel include a phone line, a cellular phone link, an RF link, a network interface, a local or wide area network, and other communications channels.

In this document, the terms ‘computer program product’, ‘computer-readable medium’ and the like may be used generally to refer to media such as, for example, memory 2408, storage device 2418, or storage unit 2422. These and other forms of computer-readable media may store one or more instructions for use by processor 2404, to cause the processor to perform specified operations. Such instructions, generally referred to as ‘computer program code’ (which may be grouped in the form of computer programs or other groupings), when executed, enable the computing system 2400 to perform functions of embodiments of the present invention. Note that the code may directly cause the processor to perform specified operations, be compiled to do so, and/or be combined with other software, hardware, and/or firmware elements (e.g., libraries for performing standard functions) to do so.

In an embodiment where the elements are implemented using software, the software may be stored in a computer-readable medium and loaded into computing system 2400 using, for example, removable storage drive 2422, drive 2412 or communications interface 2424. The control logic (in this example, software instructions or computer program code), when executed by the processor 2404, causes the processor 2404 to perform the functions of the invention as described herein.

In the foregoing specification, the invention has been described with reference to specific examples of embodiments of the invention. It will, however, be evident that various modifications and changes may be made therein without departing from the scope of the invention as set forth in the appended claims and that the claims are not limited to the specific examples described above.

The connections as discussed herein may be any type of connection suitable to transfer signals from or to the respective nodes, units or devices, for example via intermediate devices. Accordingly, unless implied or stated otherwise, the connections may for example be direct connections or indirect connections. The connections may be illustrated or described in reference to being a single connection, a plurality of connections, unidirectional connections, or bidirectional connections. However, different embodiments may vary the implementation of the connections. For example, separate unidirectional connections may be used rather than bidirectional connections and vice versa. Also, plurality of connections may be replaced with a single connection that transfers multiple signals serially or in a time multiplexed manner. Likewise, single connections carrying multiple signals may be separated out into various different connections carrying subsets of these signals. Therefore, many options exist for transferring signals.

Those skilled in the art will recognize that the architectures depicted herein are merely exemplary, and that in fact many other architectures can be implemented which achieve the same functionality.

Any arrangement of components to achieve the same functionality is effectively ‘associated’ such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as ‘associated with’ each other such that the desired functionality is achieved, irrespective of architectures or intermediary components. Likewise, any two components so associated can also be viewed as being ‘operably connected,’ or ‘operably coupled,’ to each other to achieve the desired functionality.

Furthermore, those skilled in the art will recognize that boundaries between the above described operations merely illustrative. The multiple operations may be combined into a single operation, a single operation may be distributed in additional operations and operations may be executed at least partially overlapping in time. Moreover, alternative embodiments may include multiple instances of a particular operation, and the order of operations may be altered in various other embodiments.

The present invention is herein described with reference to an integrated circuit device comprising, say, a microprocessor configured to perform the functionality of a polar decoder. However, it will be appreciated that the present invention is not limited to such integrated circuit devices, and may equally be applied to integrated circuit devices comprising any alternative type of operational functionality. Examples of such integrated circuit device comprising alternative types of operational functionality may include, by way of example only, application-specific integrated circuit (ASIC) devices, field-programmable gate array (FPGA) devices, or integrated with other components, etc. Furthermore, because the illustrated embodiments of the present invention may for the most part, be implemented using electronic components and circuits known to those skilled in the art, details have not been explained in any greater extent than that considered necessary, for the understanding and appreciation of the underlying concepts of the present invention and in order not to obfuscate or distract from the teachings of the present invention. Alternatively, the circuit and/or component examples may be implemented as any number of separate integrated circuits or separate devices interconnected with each other in a suitable manner.

Also for example, the examples, or portions thereof, may implemented as soft or code representations of physical circuitry or of logical representations convertible into physical circuitry, such as in a hardware description language of any appropriate type.

Also, the invention is not limited to physical devices or units implemented in non-programmable hardware but can also be applied in programmable devices or units able to perform the desired polar encoding by operating in accordance with suitable program code, such as minicomputers, personal computers, notepads, personal digital assistants, electronic games, automotive and other embedded systems, cell phones and various other wireless devices, commonly denoted in this application as ‘computer systems’.

However, other modifications, variations and alternatives are also possible. The specifications and drawings are, accordingly, to be regarded in an illustrative rather than in a restrictive sense.

In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word ‘comprising’ does not exclude the presence of other elements or steps then those listed in a claim. Furthermore, the terms ‘a’ or ‘an,’ as used herein, are defined as one or more than one. Also, the use of introductory phrases such as ‘at least one’ and ‘one or more’ in the claims should not be construed to imply that the introduction of another claim element by the indefinite articles ‘a’ or ‘an’ limits any particular claim containing such introduced claim element to inventions containing only one such element, even when the same claim includes the introductory phrases ‘one or more’ or ‘at least one’ and indefinite articles such as ‘a’ or ‘an.’ The same holds true for the use of definite articles. Unless stated otherwise, terms such as ‘first’ and ‘second’ are used to arbitrarily distinguish between the elements such terms describe. Thus, these terms are not necessarily intended to indicate temporal or other prioritization of such elements. The mere fact that certain measures are recited in mutually different claims does not indicate that a combination of these measures cannot be used to advantage.

REFERENCES

-   [1] E. Arikan, “Channel polarization: A method for constructing     capacity-achieving codes for symmetric binary-input memoryless     channels,” IEEE Transactions on Information Theory, vol. 55, no. 7,     pp. 3051-3073, July 2009. -   [2] K. Niu and K. Chen, “CRC-aided decoding of polar codes,” IEEE     Communications Letters, vol. 16, no. 10, pp. 1668-1671, October     2012. -   [3] Huawei, HiSilicon, “Polar code construction for NR,” in 3GPP TSG     RAN WG1 Meeting #86bis, Lisbon, Portugal, October 2016, R1-1608862. -   [4] Huawei, HiSilicon, “Evaluation of channel coding schemes for     control channel,” in 3GPP TSG RAN WG1 Meeting #86bis, Lisbon,     Portugal, October 2016, R1-1608863. -   [5] CATT, “Polar codes design for eMBB control channel,” in 3GPP TSG     RAN WG1 AH NR Meeting, Spokane, USA, January 2017, R1-1700242. -   [6] ZTE, ZTE Microelectronics, “Rate matching of polar codes for     eMBB,” in 3GPP TSG RAN WG1 Meeting #88, Athens, Greece, February     2017, R1-1701602. -   [7] I. Tal and A. Vardy, “List decoding of polar codes,” in 2011     IEEE International Symposium on Information Theory Proceedings, July     2011, pp. 1-5. -   [8] A. Balatsoukas-Stimming, M. B. Parizi, and A. Burg, “Llr-based     successive cancellation list decoding of polar codes,” IEEE     Transactions on Signal Processing, vol. 63, no. 19, pp. 5165-5179,     October 2015. -   [9] K. Niu and K. Chen, “Crc-aided decoding of polar codes,” IEEE     Communications Letters, vol. 16, no. 10, pp. 1668-1671, October     2012. -   [10] G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross,     “Fast polar decoders: Algorithm and implementation,” IEEE Journal on     Selected Areas in Communications, vol. 32, no. 5, pp. 946-957, May     2014. -   [11] P. Giard, A. Balatsoukas-Stimming, G. Sarkis, C. Thibeault,     and W. J. Gross, “Fast low-complexity decoders for low-rate polar     codes,” Journal of Signal Processing Systems, pp. 1-11, 2016.     [Online]. Available: http://dx.doi.org/10.1007/s11265-016-1173-y -   [12] P. Giard, G. Sarkis, C. Thibeault, and W. J. Gross, “237 gbit/s     unrolled hardware polar decoder,” Electronics Letters, vol. 51, no.     10, pp. 762-763, 2015. -   [13] P. Giard, G. Sarkis, C. Thibeault, and W. J. Gross, “Multi-mode     unrolled architectures for polar decoders,” IEEE Transactions on     Circuits and Systems I: Regular Papers, vol. 63, no. 9, pp.     1443-1453, September 2016. -   [14] C. Leroux, I. Tal, A. Vardy, and W. J. Gross, “Hardware     architectures for successive cancellation decoding of polar codes,”     in 2011 IEEE International Conference on Acoustics, Speech and     Signal Processing (ICASSP), May 2011, pp. 1665-1668. -   [15] C. Leroux, A. J. Raymond, G. Sarkis, and W. J. Gross, “A     semi-parallel successive-cancellation decoder for polar codes,” IEEE     Transactions on Signal Processing, vol. 61, no. 2, pp. 289-299,     January 2013. -   [16] A. Mishra, A. J. Raymond, L. G. Amaru, G. Sarkis, C. Leroux, P.     Meinerzhagen, A. Burg, and W. J. Gross, “A successive cancellation     decoder asic for a 1024-bit polar code in 180 nm cmos,” in 2012 IEEE     Asian Solid State Circuits Conference (A-SSCC), November 2012, pp.     205-208. -   [17] Y. Fan and C. y. Tsui, “An efficient partial-sum network     architecture for semi-parallel polar codes decoder implementation,”     IEEE Transactions on Signal Processing, vol. 62, no. 12, pp.     3165-3179, June 2014. -   [18] A. Balatsoukas-Stimming, A. J. Raymond, W. J. Gross, and A.     Burg, “Hardware architecture for list successive cancellation     decoding of polar codes,” IEEE Transactions on Circuits and Systems     II: Express Briefs, vol. 61, no. 8, pp. 609-613, August 2014. -   [19] J. Lin and Z. Yan, “An efficient list decoder architecture for     polar codes,” IEEE Transactions on Very Large Scale Integration     (VLSI) Systems, vol. 23, no. 11, pp. 2508-2518, November 2015. -   [20] Y. Fan, J. Chen, C. Xia, C. y. Tsui, J. Jin, H. Shen, and B.     Li, “Low-latency list decoding of polar codes with double     thresholding,” in 2015 IEEE International Conference on Acoustics,     Speech and Signal Processing (ICASSP), April 2015, pp. 1042-1046. -   [21] J. Lin, C. Xiong, and Z. Yan, “A high throughput list decoder     architecture for polar codes,” IEEE Transactions on Very Large Scale     Integration (VLSI) Systems, vol. 24, no. 6, pp. 2378-2391, June     2016. -   [22] Y. Fan, C. Xia, J. Chen, C. Y. Tsui, J. Jin, H. Shen, and B.     Li, “A low-latency list successive-cancellation decoding     implementation for polar codes,” IEEE Journal on Selected Areas in     Communications, vol. 34, no. 2, pp. 303-317, February 2016. -   [23] G. Berhault, C. Leroux, C. Jego, and D. Dallet, “Hardware     implementation of a soft cancellation decoder for polar codes,” in     2015 Conference on Design and Architectures for Signal and Image     Processing (DASIP), September 2015, pp. 1-8. -   [24] G. Sarkis, I. Tal, P. Giard, A. Vardy, C. Thibeault, and W. J.     Gross, “Flexible and low-complexity encoding and decoding of     systematic polar codes,” IEEE Transactions on Communications, vol.     64, no. 7, pp. 2732-2745, July 2016. -   [25] C. Zhang, B. Yuan, and K. K. Parhi, “Reduced-latency sc polar     decoder architectures,” in 2012 IEEE International Conference on     Communications (ICC), June 2012, pp. 3471-3475. -   [26] B. Yuan and K. K. Parhi, “Low-latency successive-cancellation     polar decoder architectures using 2-bit decoding,” IEEE Transactions     on Circuits and Systems I: Regular Papers, vol. 61, no. 4, pp.     1241-1254, April 2014. -   [27] O. Dizdar and E. Arkan, “A high-throughput energy-efficient     implementation of successive cancellation decoder for polar codes     using combinational logic,” IEEE Transactions on Circuits and     Systems I: Regular Papers, vol. 63, no. 3, pp. 436-447, March 2016. -   [28] C. Xiong, J. Lin, and Z. Yan, “A multimode area-efficient scl     polar decoder,” IEEE Transactions on Very Large Scale Integration     (VLSI) Systems, vol. 24, no. 12, pp. 3499-3512, December 2016. -   [29] C. Kim, H. Yun, S. Ajaz, and H. Lee, “High-throughput     low-complexity successive-cancellation polar decoder architecture     using ones complement scheme,” Journal of Semiconductor Technology     and Science, vol. 15, no. 3, pp. 427-435, 2015. -   [30] A. Pamuk and E. Arkan, “A two phase successive cancellation     decoder architecture for polar codes,” in 2013 IEEE International     Symposium on Information Theory, July 2013, pp. 957-961. -   [31] X. Liang, J. Yang, C. Zhang, W. Song, and X. You, “Hardware     efficient and low-latency ca-scl decoder based on distributed     sorting,” in 2016 IEEE Global Communications Conference (GLOBECOM),     December 2016, pp. 1-6. -   [32] C. Xiong, J. Lin, and Z. Yan, “Symbol-decision successive     cancellation list decoder for polar codes,” IEEE Transactions on     Signal Processing, vol. 64, no. 3, pp. 675-687, February 2016. -   [33] B. Yuan and K. K. Parhi, “Low-latency successive-cancellation     list decoders for polar codes with multibit decision,” IEEE     Transactions on Very Large Scale Integration (VLSI) Systems, vol.     23, no. 10, pp. 2268-2280, October 2015. -   [34] C. Zhang and K. K. Parhi, “Low-latency sequential and     overlapped architectures for successive cancellation polar decoder,”     IEEE Transactions on Signal Processing, vol. 61, no. 10, pp.     2429-2441, May 2013. -   [35] T. Che and G. S. Choi, “An efficient partial sums generator for     constituent code based successive cancellation decoding of polar     codes,” CoRR, vol. abs/1611.09452, 2016. [Online]. Available:     http://arxiv.org/abs/1611.09452 -   [36] J. Sha, X. Liu, Z. Wang, and X. Zeng, “A memory efficient     belief propagation decoder for polar codes,” China Communications,     vol. 12, no. 5, pp. 34-41, May 2015. 

The invention claimed is:
 1. A polar decoder kernal configured to: receive one or more soft bits from a soft kernal encoded block having a block size of N; and output one or more recovered kernal information bits from a recovered kernal information block having a block size of N; wherein at least two successive kernal information blocks have kernal block sizes N that vary from block to block and the polar decoder kernal comprises a decomposition of a polar code graph into a number of columns that depends on the kernal block size N, where at least one column comprises a number of stages selected depending on the kernel block size N.
 2. The polar decoder kernal of claim 1 wherein the polar code graph is decomposed into the arbitrary number, C, of columns and that multiple, n=log 2(N), stages in the polar code graph are distributed among these columns and wherein the polar decoder kernal is configured to group a plurality of the multiple, n=log 2(N), stages stages in the polar code graph into the arbitrary number of columns where the arbitrary number is in a range of ‘1’ to ‘C_(max)’.
 3. The polar decoder kernal of claim 2 wherein a maximum number of columns, C_(max), is selected based on a maximum block size, N_(max), a maximum number of stages accommodated in an outer column, s_(o), and a maximum number of stages accomadated in each inner column, s_(i); wherein a number of columns, C, is selected depending on the current block size, N, a maximum number of stages accommodated in an outer column, s_(o), and a maximum number of stages accommodated in each inner column s_(i); and wherein a number of stages in each column is selected in a polar decoding process depending on a current block size, N, a maximum number of stages accommodated in an outer column, s_(o), and a maximum number of stages accommodated in each inner column, s_(i).
 4. The polar decoder kernal of claim 3 wherein the outer column comprisess₀=s_(o) stages, and the remaining n−s_(o) stages are distributed among the C−1 inner columns, where s_(o) is the maximum number of stages in the outer column.
 5. The polar decoder kernal of claim 4 wherein the polar code graph is decomposed into C=┌(n−s_(o))/s_(i)┘+1 number of columns, and a right-most inner column having the index C−1 comprises s_(C−1)=n−s_(o)−(C−2)s_(i) stages and all other inner columns comprise s_(c)=s_(i) stages, where s_(c) is a number of stages in the column having the index c.
 6. The polar decoder kernal of claim 4 further comprising: a plurality of first multiplexers provided at an input to respective write ports of a bit memory block having an index c′, wherein the plurality of first multiplexers are individually controlled by the controller to select between outputs provided by a partial sum datapath having an index, c′−1, and the inner datapath, and a plurality of second multiplexers provided at an input to a partial sum datapath having an index c′, wherein the plurality of second multiplexers are individually controlled by the controller to select between outputs provided by a bit memory block of the one or more bit memory blocks having an index c′ and a partial sum datapath having an index, c′−1.
 7. The polar decoder kernal of claim 2 wherein each row in the outer column is visited once by a decoding process, whilst each row in an inner column is visited 2^(s) ^(c) times by the decoding process, where s_(c) is the number of stages in that inner column.
 8. The polar decoder kernal of claim 2 wherein when a number of first stages, s_(c), in a current column is lower than a maximum number of stages, s_(i), in an inner column, and at least one of the following is used: a number of second stages in the polar code graph is reduced to match the number of first stages, s_(c), by disabling the XOR logic gates in the left-most stages of the polar code graph; a number of second stages in a plurality of processing units is reduced to match the number of first stages, s_(c), by using multiplexers to bypass one or more processing units in the left-most stages of the plurality of processing units.
 9. The polar decoder kernal of claim 1 wherein each column comprises a number of rows, which may be expressed using the vector R=[R_(c)]_(c=0) ^(C−1), where the number of rows in a particular column, R_(c), is given by R_(c)=N/r_(c) where r_(c) is a sub-code radix of the column, and wherein each row comprises a sub-graph comprising s_(c) stages and r_(c) consecutive connections on its row edges that are horizontally-aligned and wherein each row in the inner columns is decomposed into one or more individual sub-rows that have no connections between each other.
 10. The polar decoder kernal of claim 9 wherein computations associated with each visit to each row in each inner column are spread over a number of consecutive steps of a decoding process, each of which performs computations for a different individual sub-row in the row in the inner column.
 11. The polar decoder kernal of claim 9 wherein a block size of the decomposed individual sub-rows in each inner column is selected as n_(c)=min(r_(c), n_(i)), where n_(i) specifies a maximum inner sub-row block size that adopts a value of any power of two in the range 2^(s) ^(i) to N_(max).
 12. The polar decoder kernal of claim 1 wherein the polar decoder kernal further comprises a controller, a plurality of soft bit memory blocks and an inner datapath, an outer datapath, one or more partial sum datapath(s) and one or more bit memory block(s).
 13. The polar decoder kernal of claim 12 wherein the controller configures a maximum number of stages in an outer column, s_(o), to adopt any value in a range ‘0’ to n_(max)=log₂(N_(max)) and configures the maximum number of stages in each inner column, s_(i), to adopt any value in the range 1 to n_(max)−s_(o).
 14. The polar decoder kernal of claim 12 wherein the outer datapath resides within an outer column, and wherein the inner datapath resides within different inner columns having different indices, c∈[1, C−1], during different steps of a polar decoding process and wherein the partial sum datapath with an index, c∈[1, C−2], resides within an inner column of the polar code graph having a corresponding index c and wherein an input of each of the inner datapath, the outer datapath and the partial sum datapaths is read from at least one of: one of the plurality of soft bit memory blocks, one of the one or more bit memory blocks that reside at an interface on one or other edge on either side of a current column, and wherein selected outputs of the inner datapath, the outer datapath and the partial sum datapaths are written to at least one of: one of the plurality of soft bit memory blocks one of the one or more bit memory blocks that reside at the interface on either side of the current column.
 15. The polar decoder kernal of claim 12 wherein either the inner datapath or the outer datapath is directed to process one sub-row of one row of one column in each step of a polar decoding process, and wherein the partial sum datapaths having indices ‘1’ to ‘c−1’ are each directed to process one sub-row of one row in their corresponding column whenever the inner datapath is directed to process a second or subsequent visit to one sub-row of one row in the inner column having the index ‘c’.
 16. The polar decoder kernal of claim 12 comprising a plurality, L, of parallel replicas of the inner datapath, the one or more partial sum datapaths, the one or more bit memory blocks and the soft bit memory blocks, that are used in parallel to support Successive Cancellation List, SCL, decoding processes.
 17. The polar decoder kernal of claim 1 wherein the polar decoder kernal is configured to operate on a Successive Cancellation, SC, basis wherein a recovered kernel information block is output from the polar decoder kernal concurrently with a processing of an outer column in the polar code graph, with a number of, n_(b)=2^(s) ^(o) , bits output at a time.
 18. A communication unit comprising a polar decoder kernal configured to: receive one or more soft bits from a soft kernal encoded block having a block size of N; and output one or more recovered kernal information bits from a recovered kernal information block having a block size of N; wherein at least two successive kernal information blocks have kernal block sizes N that vary from block to block and the polar decoder kernal comprises a decomposition of a polar code graph into a number of columns that depends on the kernal block size N, where at least one column comprises a number of stages selected depending on the kernel block size N.
 19. An integrated circuit for a wireless communication unit, the integrated circuit comprising a polar encoder kernal configured to: receive one or more soft bits from a soft kernal encoded block having a block size of N; and output one or more recovered kernal information bits from a recovered kernal information block having a block size of N; wherein at least two successive kernal information blocks have kernal block sizes N that vary from block to block and the polar decoder kernal comprises a decomposition of a polar code graph into a number of columns that depends on the kernal block size N, where at least one column comprises a number of stages selected depending on the kernel block size N.
 20. A method of polar encoding, at a polar decoder kernal, comprising: decomposing a polar code graph into a number of columns that depends on the kernal block size N, where at least one column comprises a number of stages selected depending on the kernel block size N and where at least two successive kernal information blocks have kernal block sizes N that vary from block to block and the polar decoder kernal; receiving one or more soft bits from a soft kernal encoded block having a block size of N; processing encoded bits; and outputting one or more recovered kernal information bits from a recovered kernal information block having a block size of N. 